Binary-Hex-Decimal Converter

This tool performs bidirectional base conversion between binary (base-2), octal (base-8), decimal (base-10), and hexadecimal (base-16) number systems. Given an input value and its known base, it computes the equivalent representation in all four bases. Internally, it first converts the input to decimal (as an integer), then reformats that value into the other bases using standard positional notation.

Firmware developers use it daily for register configuration (e.g., converting 0xFF to binary 11111111 to set specific GPIO or peripheral bits), interpreting memory dumps, decoding protocol fields (like CAN IDs or SPI command bytes), and verifying bit-mask calculations. It’s especially helpful when debugging hardware interfaces where values are commonly documented in hex but manipulated via bitwise operations in C.

The tool expects raw digit input without prefixes (e.g., enter FF for hex, not 0xFF), and you must explicitly specify the correct base (16 for hex, 2 for binary) in the “Input Base” field. Prefixes like 0x, 0b, or 0o are not parsed — they’ll cause conversion errors. For example, to convert hex A5, enter A5 and set base to 16.

The tool uses JavaScript’s Number type (IEEE 754 double-precision), safely handling integers up to ±2⁵³ − 1 (~9 quadrillion). Inputs beyond this may lose precision — especially critical for 32-bit/64-bit register values. For exact integer arithmetic beyond 2⁵³, use dedicated big-integer libraries; this tool is optimized for typical microcontroller work (≤32-bit values like 0xFFFFFFFF).

Yes — this is expected behavior. When you specify base 2, the tool interprets “1000” as binary (1×2³ + 0×2² + 0×2¹ + 0×2⁰ = 8), not decimal one thousand. Always confirm your “Input Base” matches how the number is encoded. Mis-setting the base is the most common cause of incorrect conversions.

No — it handles only non-negative integers. Two’s complement representation, signed arithmetic, and floating-point formats (e.g., IEEE 754) require specialized tools. For signed 8/16/32-bit values, manually compute two’s complement first or use a dedicated signed converter. Fractional parts (e.g., 3.14) are truncated — only the integer portion is converted.

Enter 1A3F with base 16 to get the binary output: 0b1101000111111 (padded to 16 bits: 0001101000111111). Use this binary string to identify bit positions — e.g., bit 15 = 0, bit 10 = 1 — aiding register map interpretation. The tool doesn’t auto-parse fields, but the clean binary output simplifies manual bit inspection.

Yes — enter the decimal ASCII code (e.g., 65) with base 10 to get 0x41 and 0b1000001. While the tool doesn’t map characters directly, pairing it with an ASCII table lets you quickly verify encoding, serial protocol payloads, or debug UART transmissions where data appears in hex or binary dumps.

These are standard JavaScript and C-family language literal prefixes: 0o for octal (ECMAScript 6+), 0x for hex, and 0b for binary. They ensure unambiguous interpretation in code — e.g., 0o755 clearly denotes octal permissions versus decimal 755. The prefixes are included in outputs for direct copy-paste into source files.

While languages like Python (bin(), hex()) or C (sprintf) offer conversion, this tool provides instant, side-by-side comparison across all four bases — eliminating manual switching between environments. It’s purpose-built for rapid verification during hardware bring-up, datasheet cross-referencing, and teaching digital logic concepts without writing boilerplate code.