Hex to Binary Calculator
Enter a hexadecimal number (0�9, A�F) to convert it to binary.
How to Convert Hex to Binary
Method: expand each hex digit to 4 bits
Replace each hex digit with its 4-bit binary equivalent, then concatenate.
Example: FF → F=1111, F=1111 → 11111111
Hex to 4-bit binary
| Hex | Binary | Decimal |
|---|---|---|
| 0 | 0000 | 0 |
| 5 | 0101 | 5 |
| A | 1010 | 10 |
| F | 1111 | 15 |
Related Calculators
How to Convert Hex to Binary
Since each hex digit equals exactly 4 binary digits, conversion is straightforward: replace each hex character with its 4-bit binary equivalent. For example, hex 2F: 2 = 0010, F = 1111 → binary 00101111. No arithmetic needed — it's a direct substitution. This is why hex is the preferred way to write binary data in documentation: 0x2F is much easier to read and write than 00101111, but they represent exactly the same byte.
Hex to Binary Lookup Table
| Hex | Binary | Hex | Binary |
|---|---|---|---|
| 0 | 0000 | 8 | 1000 |
| 3 | 0011 | B | 1011 |
| 5 | 0101 | D | 1101 |
| 7 | 0111 | F | 1111 |
Converting Hexadecimal to Binary
Each hex digit maps directly to exactly four binary digits (a nibble). To convert hex to binary, replace each hex character with its 4-bit binary equivalent, then read the result left to right. No division or arithmetic is required — just look up each digit. For hex 3F: 3 = 0011, F = 1111, result = 00111111. For hex 1AC: 1 = 0001, A = 1010, C = 1100, result = 000110101100. Strip leading zeros for the final answer: 110101100.
This conversion is essential when working with binary protocols, IP address subnet masks, hardware register bit fields, and assembly language. IPv4 addresses are often shown as hex in embedded systems; converting to binary reveals which bits fall in the network vs host portion. Color channels in computer graphics are commonly hex: #FF8000 = orange = R(11111111) G(10000000) B(00000000), letting you identify active color bits at a glance.
Hex Digit to 4-Bit Binary
| Hex | Binary | Decimal |
|---|---|---|
| 0 | 0000 | 0 |
| 4 | 0100 | 4 |
| 8 | 1000 | 8 |
| C | 1100 | 12 |
| 1 | 0001 | 1 |
| 5 | 0101 | 5 |
| 9 | 1001 | 9 |
| D | 1101 | 13 |
| 2 | 0010 | 2 |
| 6 | 0110 | 6 |
| A | 1010 | 10 |
| E | 1110 | 14 |
| 3 | 0011 | 3 |
| 7 | 0111 | 7 |
| B | 1011 | 11 |
| F | 1111 | 15 |
The Nibble Expansion Method for Hex-to-Binary Conversion
Converting hexadecimal to binary is one of the fastest manual conversions in computer science because each hex digit expands directly to a group of exactly four binary bits called a nibble. No arithmetic is required; you simply look up or memorize the 16 nibble mappings and write them out. Each hex digit from 0 through 9 expands to its four-bit binary representation with leading zeros as needed. Digits A through F expand to 1010 through 1111 respectively. To convert a multi-digit hex number, expand each digit independently in left-to-right order and concatenate the results. For example, hex 2F converts to 0010 1111 in binary because 2 expands to 0010 and F expands to 1111. The reverse process (binary to hex) groups bits into nibbles from right to left and converts each group to a single hex digit. Hardware engineers read processor register dumps and memory contents in hex because it compresses long binary strings into a manageable format: a 32-bit binary address requires 32 characters but only 8 hex characters. The direct relationship between hex and binary eliminates the computational overhead of going through decimal as an intermediate step.
Hex to Binary Reference Table
| Hex digit | Binary nibble | Hex digit | Binary nibble |
|---|---|---|---|
| 0 | 0000 | 8 | 1000 |
| 1 | 0001 | 9 | 1001 |
| 2 | 0010 | A | 1010 |
| 3 | 0011 | B | 1011 |
| 4 | 0100 | C | 1100 |
| 5 | 0101 | D | 1101 |
| 6 | 0110 | E | 1110 |
| 7 | 0111 | F | 1111 |
