This page uses JavaScript. Controls will not work unless you have a JavaScript aware browser. Netscape will do.
For now, you can enter a number in any system. Then just click anywhere
outside the edit control box used to input the number. Its equivalent in
other systems will appear in the corresponding text boxes.
It is customary to prefix hexadecimal numbers with 0x and octals with
0. The converter will accept this common notation which is, however, not
necessary.
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_{k}N^{k}+a_{k-1}N^{k-1}+...+a_{1}N^{1}+a_{0} |
with 0 <= a_{i} < N we have a representation of M in base N system and write
If we rewrite (1) as
(2) | M = N*(a_{k}+N*(a_{k-1}+N*...))+a_{0} |
the algorithm for obtaining coefficients a_{i} becomes more obvious. For example, a_{0}=M modulo N and a_{1}=(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:
Representation of a number in a system with base (radix) N may only consist of digits that are less than N.
Would you like to have conversions in additional bases?