Convert binary to hexadecimal by splitting the bits into 4-bit groups (nibbles) – each group maps to exactly one hex digit. The steps show the grouping for your input.
Show calculation steps
Processed privately in your browser — nothing you paste is uploaded, logged or stored.
Four bits, one digit
Hexadecimal is binary’s shorthand: because 16 = 2⁴, every group of four bits corresponds to exactly one hex digit, with no arithmetic involved. Converting is regrouping — pad the bit string to a multiple of four, slice it into nibbles, and translate each nibble by table.
This structural equivalence is why memory dumps, registers, hashes and MAC addresses are written in hex: humans read 8 characters far more reliably than 32 bits, and the mapping loses nothing.
Worked example
Input: 1101011111 Pad to 12 bits: 0011 0101 1111 Translate: 0011→3 0101→5 1111→F Result: 35F
| Decimal | Binary | Hex |
|---|---|---|
| 0 | 0000 | 0 |
| 1 | 0001 | 1 |
| 2 | 0010 | 2 |
| 3 | 0011 | 3 |
| 4 | 0100 | 4 |
| 5 | 0101 | 5 |
| 6 | 0110 | 6 |
| 7 | 0111 | 7 |
| 8 | 1000 | 8 |
| 9 | 1001 | 9 |
| 10 | 1010 | A |
| 11 | 1011 | B |
| 12 | 1100 | C |
| 13 | 1101 | D |
| 14 | 1110 | E |
| 15 | 1111 | F |
Reading hex fluently
The sixteen-row table above is the entire skill — engineers who memorise it convert on sight. Two anchors make it stick: 1010 is A (ten), and 1111 is F (fifteen). Everything else interpolates.
Everyday uses
Collapsing logic-analyser captures into readable values, writing bitmasks (0xF0 is instantly “top nibble”), comparing binary dumps against hex references in datasheets, and normalising color values — the conversion is so routine it disappears into muscle memory, which this page and its steps panel accelerate.
Exactness and privacy
Regrouping cannot round or overflow — a 256-bit hash converts to its 64 hex digits perfectly, at any length. Invalid characters are named with their position. The conversion runs in your browser only; no bit of it is transmitted.
How to use the Binary to Hex Converter
- Paste the binary number.
- Click "Convert to hex".
- The steps show the padding, the split into 4-bit groups, and each group's hex digit – for your exact bits.
- Use the options for lowercase output or an 0x prefix.
Frequently asked questions
Why does grouping in fours work?
Because 16 = 2⁴: four bits span exactly the sixteen values 0-15, which is one hex digit. The equivalence is positional and perfect – no arithmetic is needed beyond the 16-row nibble table.
What if my bit count is not a multiple of four?
Leading zeros are added on the LEFT until it is – 1101011111 becomes 0011 0101 1111 → 35F. Padding on the left never changes the value; padding on the right would multiply it.
Is hex just compressed binary, then?
For reading purposes, effectively yes – each hex digit is shorthand for one nibble, which is why registers, memory dumps, MAC addresses and color codes are written in hex: 32 bits collapse to 8 characters with zero information loss.
Uppercase or lowercase – does it matter?
Not to the value: 0x3f and 0x3F are identical. Conventions differ by ecosystem – CSS colors are commonly lowercase, assembly listings uppercase. The toggle exists so output matches your codebase style.
Can I convert a huge bit string, like 256 bits?
Yes – a 256-bit value (a hash, say) converts exactly to its 64 hex digits. Grouping never breaks, because the method is per-nibble rather than arithmetic on the whole value.
How do I go back from hex to binary?
Expand each hex digit to its 4-bit pattern – the exact inverse, no division anywhere. The Hex to Binary converter does it with steps.
Does anything I paste leave the page?
No. Grouping and mapping happen in browser JavaScript; the value is never transmitted or logged.
