COMMENTS:

Base Converter

Please note the following. Representation of a number in a system with base (radix) N may only consist of digits that are less than N.

More accurately, if

(1)	M = a_kN^k+a_k-1N^k-1+...+a₁N¹+a₀

with 0 <= a_i < n we have a representation of M in base N system and write

M = (a_ka_k-1...a₀)_N

If we rewrite (1) as

(2)	M = N(a_k+N(a_k-1+N*...))+a₀

the algorithm for obtaining coefficients a_i becomes more obvious. For example, a₀=M modulo N and a₁=(M/N) modulo N, and so on.

At one stage of conversion I use a built-in function parseInt which does not seem to return whenever this condition is violated by the very first digit. This appears to be a bug in the parseInt function. I am looking into this matter. For now, please follow the rule:

Binary:
Ternary:
Quintal:
Octal:
Decimal:
Hexadecimal: