Multi-Base Number Display

See any integer simultaneously in binary, octal, decimal, and hex

Enter an integer in any base and instantly see it in binary, octal, decimal, hexadecimal, and base-36 side by side. Handles negative numbers and arbitrary-size integers. Runs entirely in your browser. It runs free in your browser on Gera Tools, with nothing uploaded.

Last updated Source: Gera Tools

What is a number base or radix?

A base is how many distinct digit symbols a positional number system uses. Decimal (base 10) uses 0 to 9, binary (base 2) uses 0 and 1, and hexadecimal (base 16) uses 0 to 9 then A to F. The same quantity is written differently in each base but has identical value.

This tool takes a single integer and shows it simultaneously in binary, octal, decimal, hexadecimal, and base-36. Instead of converting one base at a time, you see every common representation in one glance — which is exactly what you need when debugging bit masks, colour values, permission flags, or compact short IDs.

Why seeing multiple bases at once matters

When you are working at the level of individual bits or bytes, a single integer has different “personalities” depending on the base:

  • Binary — shows every bit individually; essential for understanding bitwise AND, OR, XOR, and shift operations.
  • Octal — groups bits in threes; less common in modern code, but unix file permissions (chmod 755) are octal and the pattern still appears.
  • Decimal — the everyday human-readable form; not very useful for bit-level work but essential for communicating values to non-technical collaborators.
  • Hexadecimal — groups bits in fours; the standard for colour codes (#FF8C00), memory addresses, byte dumps, IPv6 segments, and UUID fields.
  • Base-36 — uses digits 0–9 and letters A–Z, giving 36 symbols; the most compact alphanumeric representation of an integer, popular for short URL IDs, reference numbers, and compressed identifiers.

Seeing all five at once means you can immediately check, for example, that 0xFF is 255 decimal, 377 octal, and 73 in base-36 — without switching tools or thinking through multiple conversion steps.

How the conversion works

Parsing uses a left-to-right accumulator in BigInt arithmetic:

acc = 0
for each digit character:
    acc = acc * base + digit_value

BigInt means there is no 32-bit or 64-bit ceiling — numbers with hundreds of digits work without precision loss. Once the integer value is known, each target base is rendered with repeated division:

255 (decimal)
 → binary   11111111   (8 bits for one byte)
 → octal    377        (3 + 3 + 2 bits)
 → hex      FF         (two nibbles)
 → base-36  73

Prefixed literals like 0xFF, 0b1010, and 0o755 are accepted and their prefix is stripped before parsing. Hex output is uppercase by convention; input parsing is case-insensitive. Negative numbers carry their sign into every base.

Common patterns to spot

DecimalBinaryHexWhat it often means
25511111111FFMax value of one byte; full alpha channel
655351111111111111111FFFFMax value of two bytes; max unsigned 16-bit
16777215111111111111111111111111FFFFFFMax 24-bit colour (pure white)
429496729532 onesFFFFFFFFMax unsigned 32-bit integer

Entering any of these quickly shows which bit patterns they correspond to, helping when reading kernel headers, network protocol specifications, or embedded register maps.