Number Base Converter Calculator

Positional Notation and Place Value

In a positional number system with base b, a number is represented as a sequence of digits where each digit d_i at position i (counting from right to left, starting at 0) contributes d_i × b^i to the total value. For example, in base-10, the number 325 means 3 × 10^2 + 2 × 10^1 + 5 × 10^0 = 300 + 20 + 5 = 325. This principle applies to any base: in binary (base-2), 1011 represents 1 × 2^3 + 0 × 2^2 + 1 × 2^1 + 1 × 2^0 = 8 + 0 + 2 + 1 = 11_10.

Common Number Systems in Computing

Binary (base-2) is the fundamental number system in digital computing, using only digits 0 and 1 to represent the two states of electronic circuits (off/on, low/high voltage). Octal (base-8) uses digits 0-7 and provides a convenient shorthand for binary, where each octal digit corresponds to exactly 3 binary digits. Hexadecimal (base-16) uses digits 0-9 and letters A-F (representing 10-15) and is widely used in programming because each hex digit represents exactly 4 binary digits (one nibble), making it compact yet easily convertible to binary. Decimal (base-10) is the standard system for human use, likely due to having 10 fingers. The chart shows how the same decimal values are represented across different bases.

Converting from Any Base to Decimal

To convert a number from base b to decimal (base-10), we use the polynomial expansion method. For a number (d_n d_n-1 ... d_1 d_0)_b, the decimal value is computed as: Σ_i=0^n d_i × b^i = d_n × b^n + d_n-1 × b^n-1 + ... + d_1 × b^1 + d_0 × b^0. Example: Convert (2A3)_16 to decimal: 2 × 16^2 + 10 × 16^1 + 3 × 16^0 = 512 + 160 + 3 = 675_10. This method works for any base from 2 to 36, where letters A-Z represent digit values 10-35.

Converting from Decimal to Any Base

To convert a decimal number to base b, we use the division-remainder method: repeatedly divide the decimal number by b, recording the remainders. The remainders, read in reverse order (bottom to top), give the digits in base b. Example: Convert 26_10 to binary: 26 ÷ 2 = 13 remainder 0, 13 ÷ 2 = 6 remainder 1, 6 ÷ 2 = 3 remainder 0, 3 ÷ 2 = 1 remainder 1, 1 ÷ 2 = 0 remainder 1. Reading remainders bottom-to-top: (11010)_2. For fractional parts, multiply by the base and take the integer part as the next digit. The chart demonstrates the steps of converting 26₁₀ to binary, showing how each division yields a quotient and remainder.

Direct Base-to-Base Conversion

While the standard method converts through decimal as an intermediary (source base → decimal → target base), some bases have special relationships that allow direct conversion. Powers of 2 (binary, octal, hexadecimal) can convert directly: each octal digit equals 3 binary digits, and each hexadecimal digit equals 4 binary digits. Example: (5A)_16 = (0101\ 1010)_2 = (132)_8. For bases that aren't powers of each other, going through decimal is most efficient. Binary digits can be grouped by 3 to form octal, or by 4 to form hexadecimal, enabling rapid mental conversion between these related bases.

Mathematical Properties and Theory

Any positive integer N can be uniquely represented in base b (where b ≥ 2) as: N = Σ_i=0^n d_i × b^i where 0 ≤ d_i < b and d_n ≠ 0. The number of digits required to represent N in base b is \lfloor \log_b(N) \rfloor + 1. The relationship between bases shows that higher bases require fewer digits but more distinct symbols: base-2 needs the most digits but only 2 symbols, while base-36 needs fewer digits but 36 symbols (0-9, A-Z).

Real-World Applications

Binary is essential for all digital systems, as transistors have two stable states. Hexadecimal is ubiquitous in computing: memory addresses (e.g., 0x7FFF), color codes (#FF5733 in CSS/HTML), MAC addresses, and assembly language. Octal was historically used in computing and remains in Unix file permissions (e.g., chmod 755). Base-64 encoding converts binary data to ASCII text for email attachments and URLs. Base-32 is used in human-readable identifiers like TOTP authentication codes. Some cultures historically used other bases: Babylonians used base-60 (still seen in time and angles), and the Mayans used base-20.

Computational Complexity

The time complexity of converting an n-digit number from base b_1 to base b_2 is O(n^2) using the division-remainder method, as each division can take O(n) time and we perform O(n) divisions. However, with modern algorithms using fast multiplication, this can be reduced to O(n \log n \log \log n). Space complexity is O(n) for storing the input and output. For practical purposes with reasonable-sized numbers, the simple division method is efficient enough. Converting between power-of-2 bases (binary, octal, hex) is O(n) through bit manipulation.

Worked Example

Inputs

• input: 1A
• fromBase: 16
• toBase: 2

Result: 11010

Explanation

**Converting 1A (hexadecimal) to binary:**

**Step 1: Convert hexadecimal to decimal** - 1 × 16¹ = 1 × 16 = 16 - A × 16⁰ = 10 × 1 = 10 - Sum: 16 + 10 = **26** (decimal)

**Step 2: Convert decimal (26) to binary** Using division-remainder method: - 26 ÷ 2 = 13 remainder 0 - 13 ÷ 2 = 6 remainder 1 - 6 ÷ 2 = 3 remainder 0 - 3 ÷ 2 = 1 remainder 1 - 1 ÷ 2 = 0 remainder 1

Reading remainders bottom-to-top: **11010** (binary)

**Quick Reference:** 1A₍₁₆₎ = 11010₍₂₎ = 32₍₈₎ = 26₍₁₀₎

Second Scenario

Inputs

• input: 1A
• fromBase: 19.2
• toBase: 2

Result: 11010

Explanation

This scenario uses different inputs (input = 1A, fromBase = 19.2, toBase = 2) to show how changing one variable affects the number base converter result. Run the calculator above with these values to get the exact updated output with step-by-step work.