Binary to Decimal Converter

Convert binary numbers to decimal, hexadecimal, and octal. Shows step-by-step positional calculation for learning purposes.

Enter 0s and 1s. Spaces/underscores ignored.
Decimal
214.00
Base-10 integer value (unsigned)
Binary
11010110
8-bit binary representation
Grouped Binary
1101 0110
Separated into 4-bit groups for readability
Hexadecimal
0xD6
Base-16 representation used in programming
Octal
0o326
Base-8 representation (Unix permissions, etc.)
Bit Count
8 bits
1 byte(s) needed to store this value

Bit Position Breakdown

PositionBitWeight (2ⁿ)ValueContribution
71128.001 × 128.00128.00
6164.001 × 64.0064.00
5032.000 × 32.000.00
4116.001 × 16.0016.00
308.000 × 8.000.00
214.001 × 4.004.00
112.001 × 2.002.00
001.000 × 1.000.00
Total214.00

Bit Visualization

1
1
0
1
0
1
1
0

Common Binary Values Reference

DecimalBinaryHexDescription
0.0000Zero
1.0011One
127.0011111117F7-bit max (signed byte max)
255.0011111111FF8-bit max (unsigned byte)
1,023.0011111111113FF10-bit max
65,535.001111111111111111FFFF16-bit max
Planning notes, formulas, and examples

About the Binary to Decimal Converter

The Binary to Decimal Converter converts binary (base-2) numbers to decimal (base-10), hexadecimal (base-16), and octal (base-8). Enter a string of 0s and 1s and review the converted values with a step-by-step positional breakdown showing how each bit contributes to the final number.

Binary is the native language of all computers. Every piece of data — text, images, videos, programs — is ultimately stored as binary. Understanding binary conversion is fundamental to computer science, networking, and digital electronics. Each binary digit (bit) represents a power of 2.

This converter supports binary numbers of any length and provides the equivalent value in decimal, hex, and octal for cross-referencing. The step-by-step expansion shows each bit's contribution to the total, making it a great learning tool.

When This Page Helps

Binary conversion is essential for computer science students, programmers, and network engineers. This calculator converts the value and shows the positional-notation math for educational use.

How to Use the Inputs

  1. Enter a binary number (only 0s and 1s).
  2. Spaces between groups of digits are allowed and will be stripped.
  3. View the decimal, hexadecimal, and octal equivalents.
  4. Review the positional breakdown showing each bit's value.
  5. Use this to verify subnet masks, permissions, and bitwise operations.
Formula used
decimal = Σ(bit × 2^position) Positions count from right (0) to left. Example: 1011 = 1×2³ + 0×2² + 1×2¹ + 1×2⁰ = 8 + 0 + 2 + 1 = 11

Example Calculation

Result: 214

11010110: 1×128 + 1×64 + 0×32 + 1×16 + 0×8 + 1×4 + 1×2 + 0×1 = 128 + 64 + 16 + 4 + 2 = 214. In hex: D6. In octal: 326.

Tips & Best Practices

  • Powers of 2 to memorize: 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024.
  • An 8-bit byte has a maximum decimal value of 255 (11111111 in binary).
  • Subnet masks in networking are binary patterns: 255.255.255.0 = 24 ones followed by 8 zeros.
  • Unix file permissions use 3-bit binary groups: rwx = 111 = 7 in octal.
  • Group binary digits in sets of 4 from the right to quickly convert to hex.

Binary: The Language of Computers

Every computer processor executes instructions in binary. Data is stored in binary on hard drives, SSDs, and RAM. Network packets are binary. Understanding binary is not just academic — it's practical knowledge for anyone working with technology.

Common Binary Patterns

11111111 = 255 (full byte), 10000000 = 128 (high bit set), 01111111 = 127 (max signed 8-bit), 11111111 11111111 = 65,535 (full 16-bit word). These patterns appear constantly in programming and networking.

Signed vs. Unsigned Binary

Unsigned binary treats all bits as magnitude: 8 bits hold 0–255. Signed binary (two's complement) uses the high bit as a sign bit: 8 bits hold -128 to +127. Most programming uses signed integers by default.

Sources & Methodology

Last updated:

Frequently Asked Questions

  • Write the binary number and assign powers of 2 to each bit from right (2⁰=1) to left. Multiply each bit by its power of 2 and sum the results. For 1010: 1×8 + 0×4 + 1×2 + 0×1 = 10.