Enter any hexadecimal number into the Hex Input field and get its binary equivalent instantly. You can also enable 4-bit digit grouping to make the binary output easier to read. The converter shows the binary result, the decimal equivalent, and a step-by-step conversion breakdown for each hex digit.
Binary Result
--
Decimal Equivalent
--
Hex (Uppercase)
--
Total Bits
--
Conversion Breakdown
--
Each hex digit maps directly to a 4-bit binary group called a nibble. For example, hex 6 = 0110 and hex C = 1100, so 6C in hex becomes 01101100 in binary. Just look up each digit in the hex-to-binary table and concatenate the 4-bit groups.
Hexadecimal is base-16, and 16 = 2⁴. That means any value from 0 to 15 (one hex digit) can always be represented using exactly 4 binary digits (0000 to 1111). This 1-to-4 relationship makes hex a compact shorthand for binary data.
No. This converter accepts both uppercase (A–F) and lowercase (a–f) hex letters and treats them identically. The output is normalized to uppercase for consistency.
This converter handles hex strings of any practical length for display purposes. For very large values, JavaScript's BigInt is used internally to avoid precision loss, so values well beyond 7FFFFFFFFFFFFFFF can be converted correctly.
When digit grouping is enabled, the binary output is split into groups of 4 bits separated by spaces (e.g., 0110 1100 instead of 01101100). This makes it much easier to visually map each group back to its corresponding hex digit.
Binary (base-2) uses only 0 and 1, where each digit represents a power of 2. Hexadecimal (base-16) uses digits 0–9 and letters A–F, where each digit represents a power of 16. Hex is widely used in computing as a human-friendly abbreviation for binary data.
Hexadecimal appears in memory addresses, color codes (#FF8000), machine code, network addresses (MAC/IPv6), and file formats. It compresses long binary sequences into shorter, more readable strings — two hex digits represent one byte (8 bits).
Yes. Replace each hex digit with its 4-bit binary equivalent using the lookup table (0=0000, 1=0001, … 9=1001, A=1010, B=1011, C=1100, D=1101, E=1110, F=1111), then concatenate all 4-bit groups. Leading zeros within each nibble must be kept.