The formula behind it
decimal = Σ digitᵢ × base^(positionᵢ)- digit
- a digit of the input number — letters a–z mean 10–35 so bases up to 36 work
- position
- distance from the right end, starting at 0
- two's complement
- how signed integers are stored in fixed bit widths — shown for 8- and 16-bit
Positional notation works in every base: each digit is worth its face value times the base to the power of its position. Base conversion is just re-evaluating that sum and re-expressing it — the calculator shows the expansion so the mechanics stay visible, not magical.
How to use this calculator
- 1
Enter the number (digits 0–9 plus letters a–z; case doesn't matter).
- 2
Set the input base — 2 binary, 8 octal, 10 decimal, 16 hex, or anything from 2 to 36.
- 3
All target bases render at once: binary, octal, decimal, hex and base-36.
- 4
Check the positional-expansion step to see exactly how the value is built.
- 5
Read the two's-complement rows to see the signed 8/16-bit representation when it fits.
Worked examples
FF in base 16
F = 15, so FF = 15×16 + 15×1 = 255. Binary 11111111, octal 377, and in 8-bit two's complement still 255 (it fits unsigned) — but as a signed 8-bit int it would read as −1, hence the two's-complement view.
1010 in base 2
1×2³ + 0×2² + 1×2¹ + 0×1 = 8 + 2 = 10 decimal — A in hex. The steps show each term so the place-value logic transfers to any base.