使用java 和 php 不限位數 進行進制轉換 （自定義BigNumber）

轉自：https://blog.csdn.net/xinshijimanon/article/details/46681191

/*
 * 0~9用0~9表示,10~35用A~Z表示,36~61用a~z表示
 */
@SuppressWarnings("serial")
public class BigNumber extends Exception{
    private String MyNumber;//大數
    private int SystemNumber;//進制數
    public BigNumber(){
        this("0",10);
    }
    public BigNumber(String MyNumber){
        this(MyNumber,10);
    }
    public BigNumber(String MyNumber,int SystemNumber){
        this.MyNumber=MyNumber;
        this.SystemNumber=SystemNumber;
        this.Islegal();
    }
    public String getMyNumber() {
        return this.MyNumber;
    }
    public void setMyNumber(String myNumber) {
        this.MyNumber = myNumber;
    }
    public int getSystemNumber() {
        return this.SystemNumber;
    }
    public void setSystemNumber(int systemNumber) {
        this.SystemNumber = systemNumber;
    }
    public void Islegal(){//判斷該字符串是否合法
        if(this.MyNumber==null||this.MyNumber.length()==0){//大數爲空或大數字符串長度爲0
            throw (new  NumberFormatException("錯誤!大數爲空或大數字符串長度爲0 "+this.MyNumber));
        }
        if(this.SystemNumber<=1||this.SystemNumber>=63){//進制數不合法
            throw (new  NumberFormatException("錯誤!進制數不合法 "+this.SystemNumber));
        }
        if(this.MyNumber.equals("+")||this.MyNumber.equals("-")||this.MyNumber.equals(".")){
            throw (new  NumberFormatException("錯誤!大數不合法 "+this.MyNumber));
        }
        if(this.MyNumber.equals("+.")||this.MyNumber.equals("-.")){
            throw (new  NumberFormatException("錯誤!大數不合法 "+this.MyNumber));
        }
        for(int i=0,a,k=-1;i<this.MyNumber.length();i++){
            a=Chartoint(this.MyNumber.charAt(i));
            if(i!=0&&(a==-1||a==-2)){
                throw (new  NumberFormatException("錯誤!符號位只能在大數首部 "+this.MyNumber.charAt(i)+"("+i+")"));
            }
            if(a>=this.SystemNumber||a==-4){
                throw (new  NumberFormatException("錯誤!該字符不在該進制合法字符中 "+this.MyNumber.charAt(i)+"("+i+")"));
            }
            if(a==-3){
                if(k==-1){
                    k=i;
                }else{
                    throw (new  NumberFormatException("錯誤!出現了第二個小數點 "+this.MyNumber.charAt(i)+"("+i+")"));
                }
            }
        }
    }
    private static String Add_Positive(String s1,String s2,int n){//自定義兩個正數加法運算
        String Ins1=getInteger(s1),Dos1=getDecimal(s1),Ins2=getInteger(s2),Dos2=getDecimal(s2);//分別獲取整數部分及小數部分
        int Inlength=Math.max(Ins1.length(), Ins2.length()),Dolength=Math.max(Dos1.length(), Dos2.length());
        Ins1=AddToLeft(Ins1,Inlength+1)+AddToRight(Dos1,Dolength);
        Ins2=AddToLeft(Ins2,Inlength+1)+AddToRight(Dos2,Dolength);
        String s="";
        for(int i=Inlength+Dolength,m,y=0;i>=0;i--){
            m=Chartoint(Ins1.charAt(i))+Chartoint(Ins2.charAt(i))+y;
            s=Inttochar(m%n)+s;
            y=m/n;
        }
        int pointplace=s.length()-Dolength;
        s=Format(s.substring(0,pointplace)+"."+s.substring(pointplace),true);
        return s;
    }
    private static String Sub_Positive(String s1,String s2,int n){//自定義兩個正數減法運算;
        if(ComparetoString(s1,s2)<0){//如果s1<s2則返回-(s2-s1)
            return "-"+Sub_Positive(s2,s1,n);

        }
        String Ins1=getInteger(s1),Dos1=getDecimal(s1),Ins2=getInteger(s2),Dos2=getDecimal(s2);//分別獲取整數部分及小數部分
        int Inlength=Math.max(Ins1.length(), Ins2.length()),Dolength=Math.max(Dos1.length(), Dos2.length());
        String R=getComplement(new BigNumber(AddToLeft(Ins2,Inlength)+"."+AddToRight(Dos2,Dolength),n)).MyNumber;
        R=Add_Positive(s1,R,n);
        s2="0."+AddToLeft("1",Dolength);
        R=Add_Positive(R,s2,n);
        return Format(R.substring(1),true);
    }
    private static String Mult_Positive(String s1,String s2,int n){//自定義兩個正數乘法運算;
        String Ins1=getInteger(s1),Dos1=getDecimal(s1),Ins2=getInteger(s2),Dos2=getDecimal(s2);//分別獲取整數部分及小數部分
        Ins1+=Dos1;
        Ins2+=Dos2;
        int[]A=new int[Ins1.length()+Ins2.length()-1];
        for(int i=Ins1.length()-1;i>=0;i--){
            for(int j=Ins2.length()-1;j>=0;j--){
                A[i+j]+=Chartoint(Ins1.charAt(i))*Chartoint(Ins2.charAt(j));
            }
        }
        String s="";
        for(int i=A.length-1;i>=1;i--){
            s=Inttochar(A[i]%n)+s;
            A[i-1]+=A[i]/n;
        }
        s=Inttochar(A[0]/n)+""+Inttochar(A[0]%n)+s;//特別要注意+""
        int pointlength=Dos1.length()+Dos2.length();//獲取小數點後的位數
        return Format(s.substring(0,s.length()-pointlength)+"."+s.substring(s.length()-pointlength),true);
    }
    private static String  Division_Positive(String s1, String s2,int n,int f){//自定義兩個正數相除(f爲小數點後的位數,能被除盡，且小數點後的位數少於f,則直接返回結果);
        String Ins1=getInteger(s1),Dos1=getDecimal(s1),Ins2=getInteger(s2),Dos2=getDecimal(s2); //分別獲取整數部分及小數部分
        int Dolength=Math.max(Dos1.length(), Dos2.length());
        Ins1+=AddToRight(Dos1,Dolength);
        Ins2+=AddToRight(Dos2,Dolength);
        String[]B=new String[n];B[0]="0";
        for(int i=1;i<n;i++){
            B[i]=Add_Positive(B[i-1],Ins2,n);//B[i]=Mult_Positive(Ins2,Inttochar(i)+"", n);
        }
        int i=Math.min(Ins1.length(), Ins2.length())-2,j;
        String Ds0="",Ds1=Ins1.substring(0,i);//初始化整數部分餘數部分
        while(true){
            if(i!=Ins1.length()){
                if(i<Ins1.length()){
                    Ds1+=Ins1.charAt(i);
                }else{
                    Ds1+="0";
                    if(Ds1.equals("00")||i-Ins1.length()-1==f){
                        break;
                    }
                }
                //下面開始求Ds1/Ins2的整數部分及餘數,結果分別賦值爲Ds0,Ds1;採用二分查找獲取整數部分
                j=Binary(B,Ds1);
                Ds0+=Inttochar(j);
                Ds1=Sub_Positive(Ds1,B[j],n);
            }else{
                Ds0+=".";
            }
            i++;
        }
        return Format(Ds0,true);
    }
    private static int Binary(String[]A,String key){//二分查找key(數組A已經按從小到大的順序排好序)
        int low=0,height=A.length-1,middle,Compare;
        while(low<=height){
            middle=(low+height)/2;
            Compare=ComparetoString(key,A[middle]);
            if(Compare==0){
                return middle;
            }else if(Compare>0){
                low=middle+1;
            }else{
                height=middle-1;
            }
        }
        return height;
    }
    public BigNumber Add(BigNumber b){//自定義加法運算
        if(this.SystemNumber!=b.SystemNumber){
            throw (new  NumberFormatException("錯誤!這兩個大數進制數不一致 ("+this.SystemNumber+","+b.SystemNumber+")"));
        }
        String s;
        if(IsPositive(this.MyNumber)&&IsPositive(b.MyNumber)){
            s=Add_Positive(this.MyNumber,b.MyNumber,this.SystemNumber);
        }else if(IsPositive(this.MyNumber)&&!IsPositive(b.MyNumber)){
            s=Sub_Positive(this.MyNumber,Opposite(b.MyNumber),this.SystemNumber);
        }else if(!IsPositive(this.MyNumber)&&IsPositive(b.MyNumber)){
            s=Sub_Positive(b.MyNumber,Opposite(this.MyNumber),this.SystemNumber);
        }else{
            s=Add_Positive(Opposite(this.MyNumber),Opposite(b.MyNumber),this.SystemNumber);
            s=(s.equals("0")?"":"-")+s;
        }
        return new BigNumber(s,this.SystemNumber);
    }
    public BigNumber Sub(BigNumber b){//自定義減法運算
        return this.Add(new BigNumber(Opposite(b.MyNumber),b.SystemNumber));
    }
    public BigNumber Mult(BigNumber b){//自定義乘法運算
        if(this.SystemNumber!=b.SystemNumber){
            throw (new  NumberFormatException("錯誤!這兩個大數進制數不一致 ("+this.SystemNumber+","+b.SystemNumber+")"));
        }
        String s;
        if(IsPositive(this.MyNumber)&&IsPositive(b.MyNumber)){
            s=Mult_Positive(this.MyNumber,b.MyNumber,this.SystemNumber);
        }else if(IsPositive(this.MyNumber)&&!IsPositive(b.MyNumber)){
            s=Mult_Positive(this.MyNumber,Opposite(b.MyNumber),this.SystemNumber);
            s=(s.equals("0")?"":"-")+s;
        }else if(!IsPositive(this.MyNumber)&&IsPositive(b.MyNumber)){
            s=Mult_Positive(Opposite(this.MyNumber),b.MyNumber,this.SystemNumber);
            s=(s.equals("0")?"":"-")+s;
        }else{
            s=Mult_Positive(Opposite(this.MyNumber),Opposite(b.MyNumber),this.SystemNumber);
        }
        return new BigNumber(s,this.SystemNumber);
    }
    public BigNumber Division(BigNumber b,int f){//自定義除法運算(f爲小數點後的位數,能被除盡,且小數點後的位數少於f,則直接返回精確結果);
        if(b.toString().equals("-0")||b.toString().equals("0")){
            throw (new  NumberFormatException("錯誤!除數不能爲零:"+b));
        }
        if(this.SystemNumber!=b.SystemNumber){
            throw (new  NumberFormatException("錯誤!這兩個大數進制數不一致! ("+this.SystemNumber+","+b.SystemNumber+")"));
        }
        if(f<0){
            throw (new  NumberFormatException("錯誤!小數點後的位數應爲非負值!("+f+")"));
        }
        String s;
        if(IsPositive(this.MyNumber)&&IsPositive(b.MyNumber)){
            s=Division_Positive(this.MyNumber,b.MyNumber,this.SystemNumber,f);
        }else if(IsPositive(this.MyNumber)&&!IsPositive(b.MyNumber)){
            s=Division_Positive(this.MyNumber,Opposite(b.MyNumber),this.SystemNumber,f);
            s=(s.equals("0")?"":"-")+s;
        }else if(!IsPositive(this.MyNumber)&&IsPositive(b.MyNumber)){
            s=Division_Positive(Opposite(this.MyNumber),b.MyNumber,this.SystemNumber,f);
            s=(s.equals("0")?"":"-")+s;
        }else{
            s=Division_Positive(Opposite(this.MyNumber),Opposite(b.MyNumber),this.SystemNumber,f);
        }
        return new BigNumber(s,this.SystemNumber);
    }
    public BigNumber Division(BigNumber b){//自定義除法運算,默認爲保留50位小數(若能被除盡,且小數點後的位數少於50,則直接返回精確結果);
        return Division(b,50);
    }
    private static int ComparetoString(String s1,String s2){//判斷兩個正數的大小s1>s2返回1,s1=s2返回0,s1<s2返回-1
        String Ins1=getInteger(s1),Dos1=getDecimal(s1),Ins2=getInteger(s2),Dos2=getDecimal(s2);
        int Dolength=Math.max(Dos1.length(), Dos2.length());
        Ins1+=AddToRight(Dos1,Dolength);
        Ins2+=AddToRight(Dos2,Dolength);
        if(Ins1.length()>Ins2.length()){
            return 1;
        }else if(Ins1.length()<Ins2.length()){
            return -1;
        }
        for(int i=0;i<Ins1.length();i++){
            if(Ins1.charAt(i)>Ins2.charAt(i)){
                return 1;
            }else if(Ins1.charAt(i)<Ins2.charAt(i)){
                return -1;
            }
        }
        return 0;
    }
    public int Compareto(BigNumber b){
        if(this.SystemNumber!=b.SystemNumber){
            throw (new  NumberFormatException("錯誤!這兩個大數進制數不一致 ,暫時無法比較("+this.SystemNumber+","+b.SystemNumber+")"));
        }
        String s1=Format(this.MyNumber,false),s2=Format(b.MyNumber,false);
        if(IsPositive(s1)&&IsPositive(s2)){
            return ComparetoString(s1,s2);//int a=s1.CompareTo(s2); return a!=0?(a>0?1:-1):0;
        }else if(IsPositive(s1)&&!IsPositive(s2)){
            return 1;
        }else if(!IsPositive(s1)&&IsPositive(s2)){
            return -1;
        }else{
            return -ComparetoString(s1.substring(1),s2.substring(1));
        }
    }
    private static String ConverFromTen(long n,int R){//將十進制數n轉換爲R進制數
        if(R==10){
            return n+"";
        }
        String s="";
        while(true){
            s=Inttochar((int)(n%R))+s;
            n/=R;
            if(n==0){
                return s;
            }
        }
    }
    /*
     * 將R1進制正整數s轉化爲R2進制數
     * (由於Conversion頻繁調用該函數,爲提高效率,引入兩個輔助數組Hex1,Hex2):
     * Hex1[i]是十進制數i轉換爲R2進制數後的數,0<=i<=R1;Hex2[i]=Hex1[R1]^i,0<=i<=s.length()
     * Hex2[i]是十進制數R1轉換爲R2進制數後的i次方
     */
    private static String Conver(String s,int R2,String[]Hex1,String[]Hex2){
        String Ins="0";//初始化新進制對應的大數
        for(int i=0;i<s.length();i++){
            Ins=Add_Positive(Ins,Mult_Positive(Hex1[Chartoint(s.charAt(s.length()-1-i))],Hex2[i],R2),R2);
        }
        return Ins;
    }
    private static String Conversion(String MyNumber,int R1,int R2,int N,int f){//將R1進制大數MyNumber轉換爲R2進制的大數(f爲小數點後的位數,能被除盡,且小數點後的位數少於f,則直接返回結果),N爲將MyNumber分組後每組字符串的長度;
        if(R2==R1){
            int a=getDecimal(MyNumber).length()-f;
            if(a>0){
                return MyNumber.substring(0,MyNumber.length()-a);
            }
            return MyNumber;
        }
        if(MyNumber.charAt(0)=='+'||MyNumber.charAt(0)=='-'){
            char c=MyNumber.charAt(0);
            return c+Conversion(MyNumber.substring(1),R1,R2,N,f);
        }
        String[]Hex1=new String[R1+1];
        for(int i=0;i<=R1;i++){//將0~R1的所有數字轉換爲R2進制
            Hex1[i]=ConverFromTen(i,R2);
        }
        String[]Hex2=new String[N+1];Hex2[0]="1";
        for(int i=1;i<=N;i++){//求十進制數R1轉換爲R2進制數後的i次方
            Hex2[i]=Mult_Positive(Hex2[i-1],Hex1[R1],R2);
        }
        String Ins1=getInteger(MyNumber),Dos1=getDecimal(MyNumber);//獲取整數部分及小數部分
        /*
         * 經過計算當轉化後的R2進制數只需保留f位小數時,原R1進制數MyNumber只需保留a位
         * 當MyNumber小數位很多，而f較小時在一定程度上能提高效率
         */
        int a=(int)Math.ceil(f*Math.log(R2)/Math.log(R1))+1;
        if(a<=Dos1.length()){
            Dos1=Dos1.substring(0,a);
        }

        Ins1=AddToLeft(Ins1,Ins1.length()+(N-Ins1.length()%N)%N);//擴充Ins1
        Dos1=AddToRight(Dos1,Dos1.length()+(N-Dos1.length()%N)%N);//擴充Dos1
        String Ins="0",Dos="0",x="1";//new BigNumber(Conver1(R1,R2),R2).Power(N).MyNumber;初始化新進制對應的大數的整數部分及小數部分 ,設置初值及權
        int Count=Math.max(Ins1.length()/N,Dos1.length()/N);//循環次數
        for(int i=0,i1=Ins1.length()/N,i2=Dos1.length()/N;i<Count;i++){
            if(i<i1){
                Ins=Add_Positive(Ins,Mult_Positive(Conver(Ins1.substring(Ins1.length()-(i+1)*N,Ins1.length()-i*N),R2,Hex1,Hex2),x,R2),R2);
            }
            if(i<i2){
                Dos=Add_Positive(Dos,Mult_Positive(Conver(Dos1.substring(Dos1.length()-(i+1)*N,Dos1.length()-i*N),R2,Hex1,Hex2),x,R2),R2);
                if(i==i2-1){
                    Dos=Division_Positive(Dos,Mult_Positive(x,Hex2[N],R2),R2,f);
                }
            }
            x=Mult_Positive(x,Hex2[N],R2);
        }
        return Ins+Dos.substring(1);//或Add_Positive(Ins,Dos,R2);
    }
    public BigNumber HexConversion(int R,int N,int f){
        if(R<=1||R>=63){//進制數不合法
            throw (new  NumberFormatException("錯誤!進制數不合法 "+this.SystemNumber));
        }
        if(N<=0){
            throw (new  NumberFormatException("錯誤!每小組的字符串長度不能小於1!("+N+")"));
        }
        if(f<0){
            throw (new  NumberFormatException("錯誤!小數點後的位數應爲非負值!("+f+")"));
        }
        return new BigNumber(Conversion(this.MyNumber,this.SystemNumber,R,N,f),R);
    }
    public BigNumber HexConversion(int R,int f){
        int N=(int)Math.pow(Math.max(getInteger(this.MyNumber).length(),getDecimal(this.MyNumber).length()),0.6)+1;
        return HexConversion(R,N,f);
    }
    public BigNumber HexConversion(int R){
        return HexConversion(R,50);
    }

    /*public BigNumber Power(int n,int f){
        if(n<0){
            return new BigNumber("1",this.SystemNumber).Division(this.Power(-n,f),f);
        }
        String s=ConverFromTen(n,2);
        BigNumber r=new BigNumber("1",this.SystemNumber),k=this;
        for(int i=0;i<s.length();i++){
            if(s.charAt(s.length()-1-i)=='1'){
                r=r.Mult(k);
            }
            k=k.Mult(k);
        }
        return r;
    }
    public BigNumber Power(int n){
        return Power(n,50);
    }*/

    private static BigNumber getComplement(BigNumber b){//獲得 b的每位取反後的大數
        String s="";
        char c=b.MyNumber.charAt(0);
        if(c=='+'||c=='-'||c=='.'){
            s+=c;
        }else{
            s+=Inttochar(b.SystemNumber-1-Chartoint(c));
        }
        for(int i=1;i<b.MyNumber.length();i++){
            c=b.MyNumber.charAt(i);
            if(c=='.'){
                s+=c;
            }else{
                s+=Inttochar(b.SystemNumber-1-Chartoint(c));
            }
        }
        return new BigNumber(s,b.SystemNumber);
    }
    private static String AddToLeft(String s,int length){//若s的長度大於或等於length,則直接返回s,否則字符串s左邊補零,直到s長度達到length
        if(s.length()>=length){
            return s;
        }
        while(s.length()<length){
            s="0000000000"+s;
        }
        return s.substring(s.length()-length,s.length());
    }
    private static String AddToRight(String s,int length){//若s的長度大於或等於length,則直接返回s,否則字符串s右邊補零,直到s長度達到length
        if(s.length()>=length){
            return s;
        }
        while(s.length()<length){
            s=s+"0000000000";
        }
        return s.substring(0,length);
    }
    private static String Format(String MyNumber,boolean DealZero){//對於合法的大數,格式化大數爲a.b(或-a.b)的形式,若b=0且DealZero爲真則返回a(或-a)的形式
        new BigNumber(MyNumber,62);//若該大數不合法則拋出異常
        String s;
        if(MyNumber.charAt(0)=='+'||MyNumber.charAt(0)=='-'){
            s=MyNumber.substring(1);
        }else{
            s=MyNumber;
        }
        if(getPointPlace(s)==0){
            s="0"+s;
        }else if(getPointPlace(s)==s.length()-1){
            s=s+"0";
        }else if(getPointPlace(s)==s.length()){
            s=s+".0";
        }
        int Ins=0,Dos=s.length(),pointplace=getPointPlace(s);
        for(int i=0;i<pointplace-1;i++){
            if(s.charAt(i)=='0'){
                Ins++;
            }else{
                break;
            }
        }
        for(int i=s.length()-1;i>pointplace+1;i--){
            if(s.charAt(i)=='0'){
                Dos--;
            }else{
                break;
            }
        }
        s=(MyNumber.charAt(0)=='-'?"-":"")+s.substring(Ins,Dos);
        if(DealZero&&s.substring(s.length()-2).equals(".0")){
            return s.substring(0,s.length()-2);
        }else{
            return s;
        }
    }
    private static boolean IsPositive(String MyNumber){//判斷該大數是否爲正數(負數返回false,0和正數返回true)
        if(MyNumber.charAt(0)=='-'){
            return false;
        }
        return true;
    }
    private static int  getPointPlace(String MyNumber){//返回該大數小數點位置
        for(int i=0;i<MyNumber.length();i++){
            if(MyNumber.charAt(i)=='.'){
                return i;
            }
        }
        return MyNumber.length();
    }
    private static String Abs(String MyNumber){//返回該大數的絕對值
        MyNumber=Format(MyNumber,true);
        return MyNumber.substring(MyNumber.charAt(0)=='-'?1:0);
    }
    private static String Opposite(String MyNumber){//返回該大數的相反數
        return MyNumber.charAt(0)=='-'?Abs(MyNumber):"-"+Abs(MyNumber);
    }
    private static String getInteger(String MyNumber){//返回該大數的整數部分
        MyNumber=Format(MyNumber,false);
        return MyNumber.substring(0,getPointPlace(MyNumber));
    }
    private static String getDecimal(String MyNumber){//返回該大數的小數部分
        MyNumber=Format(MyNumber,false);
        String s=getPointPlace(MyNumber)==MyNumber.length()?"0":MyNumber.substring(getPointPlace(MyNumber)+1);
        return (MyNumber.charAt(0)=='-'?"-":"")+s;
    }
    private static int Chartoint(char c){//字符化爲數字
        if(c>='0'&&c<='9'){
            return c-'0';
        }else if(c>='A'&&c<='Z'){
            return c-'A'+10;
        }else if(c>='a'&&c<='z'){
            return c-'a'+36;
        }else if(c=='+'){//正號
            return -1;
        }else if(c=='-'){//負號
            return -2;
        }else if(c=='.'){//小數點
            return -3;
        }else{//其他
            return -4;
        }
    }
    private static char Inttochar(int n){//數字化爲字符
        if(n>=0&&n<=9){//0~9用0~9表示
            return (char)(n+48);
        }else if(n>=10&&n<=35){//10~35用A~Z表示
            return (char)(n+55);
        }else if(n>=36&&n<=61){//36~61用a~z表示
            return (char)(n+61);
        }else{//小於0或大於61的數用'~'表示
            return '~';
        }
    }
    public String toString(){
        return Format(this.MyNumber,true);
    }
}

順便寫了個測試類測試進制轉換的效果與效率

測試類:

public class TestBigNumber {
    public static void main(String[]args){
        String MyNumber="1313624242ADAFSFGDRG424242ADAF679707464342424242ADAFS24242ADAFSFGDRG424242ADAFFGDRG142356679707464342424242ADAFSFGDRG67866679707464342424242ADAFSFGDRG96068563556667970746V6679707464342424423536858686242ADAFSFGD69979RG67970746434242427979742ADAFS.FGDRG646676679707464342424242ADAFSFGDRG9707464342424242ADAFSFGDRG342424242ADAFSFGDRG67970746434266797074643426679707464342424242ADAFSFGDRG424242ADAFSFGDRG424242ADAFSFGDRG24242342426679707464342424242ADAFSFGDRG534364547455686679707464342424242ADAFSFGDRG6679707464342424242ADAFSFGDRGDADA6679707464342424242ADAFSFGDRGAFSFS6679707464342424242ADAFSFGDRG";
        int R1=39,R2=62,R3=2;
        int f=MyNumber.length()-MyNumber.indexOf('.')-1;
        BigNumber b=new BigNumber(MyNumber,R1);
        BigNumber b1,b2,b3,b4;
        long c1=System.currentTimeMillis();
        b1=b.HexConversion(R2, f);
        System.out.println("將"+b.getSystemNumber()+"進制數\n"+b.getMyNumber()+"轉化爲"+R2+"進制數並保留"+f+"位小數後去除無效位的結果爲:\n"+b1);
        long c2=System.currentTimeMillis();
        b2=b.HexConversion(R3, f);
        System.out.println("將"+b.getSystemNumber()+"進制數\n"+b.getMyNumber()+"轉化爲"+R3+"進制數並保留"+f+"位小數後去除無效位的結果爲:\n"+b2);
        long c3=System.currentTimeMillis();
        b3=b1.HexConversion(R1, f);
        System.out.println("將"+b1.getSystemNumber()+"進制數\n"+b1.getMyNumber()+"轉化爲"+R1+"進制數並保留"+f+"位小數後去除無效位的結果爲:\n"+b3);
        long c4=System.currentTimeMillis();
        b4=b2.HexConversion(R1, f);
        System.out.println("將"+b2.getSystemNumber()+"進制數\n"+b2.getMyNumber()+"轉化爲"+R1+"進制數並保留"+f+"位小數後去除無效位的結果爲:\n"+b4);
        long c5=System.currentTimeMillis();
        System.out.println("四次轉換分別耗時爲"+(c2-c1)+"ms,"+(c3-c2)+"ms,"+(c4-c3)+"ms,"+(c5-c4)+"ms");
    }
}

測試結果:

將39進制數
1313624242ADAFSFGDRG424242ADAF679707464342424242ADAFS24242ADAFSFGDRG424242ADAFFGDRG142356679707464342424242ADAFSFGDRG67866679707464342424242ADAFSFGDRG96068563556667970746V6679707464342424423536858686242ADAFSFGD69979RG67970746434242427979742ADAFS.FGDRG646676679707464342424242ADAFSFGDRG9707464342424242ADAFSFGDRG342424242ADAFSFGDRG67970746434266797074643426679707464342424242ADAFSFGDRG424242ADAFSFGDRG424242ADAFSFGDRG24242342426679707464342424242ADAFSFGDRG534364547455686679707464342424242ADAFSFGDRG6679707464342424242ADAFSFGDRGDADA6679707464342424242ADAFSFGDRGAFSFS6679707464342424242ADAFSFGDRG轉化爲62進制數並保留348位小數後去除無效位的結果爲:
CSicxuSbDy6b15mLRWpdQ03beazrJG5zcEBpMTZ7oxowiNnCN2V2M9xDYHbAF9g6yYEPhEPyQi1Jki1eamKZv9ceksCKkZzNjHDFv7wnmlCJSPVJtkFovcB65NUUYnHyMRYOMrt7wpQg1cy9UFqoVJOg6uicQZDDxdsxW7OdFtG60YEkAx3uuL6izr87hebmroc4ZHum8izmVRxylA1mARwFa.OVmjfCSTpwpEPSYDMTLpzKxV1LWaoEOdZV8Q5Ie2y8XeUDJ5M5Yh4QksANCxWcYlDW1v3XpvZ5AXC7XLlR5uyHK63kwPWpwJhLh6nm0ypGg1iwIWo1N7DP6JQEz3cP5kJx90WtGH6BOEmMgsRPC4cOnUYeS6Ckx8KmdNtMl1P2qN6cHsxZFYOgPg3MRHuNVMhuApscNlpkWlM11Yj5X8nAuLW140Pj4PEn5jgktOGO2y20LPgqM77GGz6d0PyF0H3EL7OwAVLVv1ARt4jlKbomwr1rRyqvV975kZtJVatHkNsr8PCLHGz63p59NIQRkXOd6cyROVnwCpRtmBi3dXU4Vlo0Z7
將39進制數
1313624242ADAFSFGDRG424242ADAF679707464342424242ADAFS24242ADAFSFGDRG424242ADAFFGDRG142356679707464342424242ADAFSFGDRG67866679707464342424242ADAFSFGDRG96068563556667970746V6679707464342424423536858686242ADAFSFGD69979RG67970746434242427979742ADAFS.FGDRG646676679707464342424242ADAFSFGDRG9707464342424242ADAFSFGDRG342424242ADAFSFGDRG67970746434266797074643426679707464342424242ADAFSFGDRG424242ADAFSFGDRG424242ADAFSFGDRG24242342426679707464342424242ADAFSFGDRG534364547455686679707464342424242ADAFSFGDRG6679707464342424242ADAFSFGDRGDADA6679707464342424242ADAFSFGDRGAFSFS6679707464342424242ADAFSFGDRG轉化爲2進制數並保留348位小數後去除無效位的結果爲:
110101101010110010111000101001101101000100001111010000100111110011011011000111010010000001100101000011100001001100010000111001010100011011101110010111011001011101001110011110100011101010100110111001010011011110011001011111001111000010010000010101110100010010000011111111011100010001110111111111111101110000110010001001110100100001010111100110001101110001001011110000101011000010100110100101111000110111111100110010101111111101011100110100100100101111011010001111001111111010101100100010110100001100101010111101010110100101000100110100011110001011000011110011001010001110000001001101110011011001011100110101011011101110000011010100001011100101111001000110110111010010100101100101011110101010001101100010000000000111100110010111011110010101011011001111100110000100010000011001011110101111001001001011111110110110110110101011100101100011111011011010100001000100100101010100111100111110110001010001000011001011000111111101100111011011110110001101101010000100101000110010100000110011111100001001101000000010101000000010110000001000101111001111111100010100000111110010010100000110011100100111001010001101010111010110100100011011000011100001001100110010010100110001010001011110101111100111110110000001111101110011100110101101101101011110010111100001001000001110100100000001011111100010101110110110.011001010011011010110001001001110110111110110101111110111110010011011101011111000001100101000110110001001011101011100010000101010010110101111011111101111100010100010100010101100001100100111111011110001101111111010111111010011001000110101011101000100111100010111100010110110110100001000001110011110010110110110101110111000100100111111100110010010011
將62進制數
CSicxuSbDy6b15mLRWpdQ03beazrJG5zcEBpMTZ7oxowiNnCN2V2M9xDYHbAF9g6yYEPhEPyQi1Jki1eamKZv9ceksCKkZzNjHDFv7wnmlCJSPVJtkFovcB65NUUYnHyMRYOMrt7wpQg1cy9UFqoVJOg6uicQZDDxdsxW7OdFtG60YEkAx3uuL6izr87hebmroc4ZHum8izmVRxylA1mARwFa.OVmjfCSTpwpEPSYDMTLpzKxV1LWaoEOdZV8Q5Ie2y8XeUDJ5M5Yh4QksANCxWcYlDW1v3XpvZ5AXC7XLlR5uyHK63kwPWpwJhLh6nm0ypGg1iwIWo1N7DP6JQEz3cP5kJx90WtGH6BOEmMgsRPC4cOnUYeS6Ckx8KmdNtMl1P2qN6cHsxZFYOgPg3MRHuNVMhuApscNlpkWlM11Yj5X8nAuLW140Pj4PEn5jgktOGO2y20LPgqM77GGz6d0PyF0H3EL7OwAVLVv1ARt4jlKbomwr1rRyqvV975kZtJVatHkNsr8PCLHGz63p59NIQRkXOd6cyROVnwCpRtmBi3dXU4Vlo0Z7轉化爲39進制數並保留348位小數後去除無效位的結果爲:
1313624242ADAFSFGDRG424242ADAF679707464342424242ADAFS24242ADAFSFGDRG424242ADAFFGDRG142356679707464342424242ADAFSFGDRG67866679707464342424242ADAFSFGDRG96068563556667970746V6679707464342424423536858686242ADAFSFGD69979RG67970746434242427979742ADAFS.FGDRG646676679707464342424242ADAFSFGDRG9707464342424242ADAFSFGDRG342424242ADAFSFGDRG67970746434266797074643426679707464342424242ADAFSFGDRG424242ADAFSFGDRG424242ADAFSFGDRG24242342426679707464342424242ADAFSFGDRG534364547455686679707464342424242ADAFSFGDRG6679707464342424242ADAFSFGDRGDADA6679707464342424242ADAFSFGDRGAFSFS6679707464342424242ADAFSFGDRF
將2進制數
110101101010110010111000101001101101000100001111010000100111110011011011000111010010000001100101000011100001001100010000111001010100011011101110010111011001011101001110011110100011101010100110111001010011011110011001011111001111000010010000010101110100010010000011111111011100010001110111111111111101110000110010001001110100100001010111100110001101110001001011110000101011000010100110100101111000110111111100110010101111111101011100110100100100101111011010001111001111111010101100100010110100001100101010111101010110100101000100110100011110001011000011110011001010001110000001001101110011011001011100110101011011101110000011010100001011100101111001000110110111010010100101100101011110101010001101100010000000000111100110010111011110010101011011001111100110000100010000011001011110101111001001001011111110110110110110101011100101100011111011011010100001000100100101010100111100111110110001010001000011001011000111111101100111011011110110001101101010000100101000110010100000110011111100001001101000000010101000000010110000001000101111001111111100010100000111110010010100000110011100100111001010001101010111010110100100011011000011100001001100110010010100110001010001011110101111100111110110000001111101110011100110101101101101011110010111100001001000001110100100000001011111100010101110110110.011001010011011010110001001001110110111110110101111110111110010011011101011111000001100101000110110001001011101011100010000101010010110101111011111101111100010100010100010101100001100100111111011110001101111111010111111010011001000110101011101000100111100010111100010110110110100001000001110011110010110110110101110111000100100111111100110010010011轉化爲39進制數並保留348位小數後去除無效位的結果爲:
1313624242ADAFSFGDRG424242ADAF679707464342424242ADAFS24242ADAFSFGDRG424242ADAFFGDRG142356679707464342424242ADAFSFGDRG67866679707464342424242ADAFSFGDRG96068563556667970746V6679707464342424423536858686242ADAFSFGD69979RG67970746434242427979742ADAFS.FGDRG646676679707464342424242ADAFSFGDRG9707464342424242ADAFSFGDRG2UXNCMJNcZJJTAYBcNcPCOYPEHSET1EJ9c650HV24PNO1CDYUMXBEVT8P294CL2Lc81MQIRODQD6YUH3HVa7ADOUHW696PF2c0KU8XJJa6WYYASbGYRTUCCVO0BD8AGZEMSW2MWTCI3NbHFZW8GIC0FTRYNV8TCVAQF9N6AZHMDB5N16IWGUPHU812HN7AMT97LIUFX9DEZ5B841I6KMS3JGNMYVF79FXQHK8Y8DJKUUV3AaJVEWS80ZSaC0IKcVCXAaB5I3WBC2KAIGG0AIbR2Z2Ob
四次轉換分別耗時爲468ms,169ms,195ms,75ms

使用php：

<?php
//超大整數（10進制）轉換爲二進制數
$n='12121111111141417908308410289576890247569807456709384756890743906790486790845';
//$n='15';//1111
//$n='257';//100000001
$r='';//結果
while ($n){
  //$n整除2，商$m、餘數$k
  $k=0;
  $m='';
  do{
    $k=$k*10 + substr($n,0,1);
    if ($m!='' || $k>1) $m.=floor($k/2);
    $k=$k % 2;
    $n=substr($n,1);
    //$r=$k . $r;
  }while($n!='');
  //echo "r=$r;m=$m\n";//break;
  //下一輪除法
  $n=$m;
  $r=$k . $r;
}
echo $r;
?>