Arithmetic • Flagship Guide

Binary to Decimal Converter

Convert numbers easily between Binary (Base 2), Decimal (Base 10), Hexadecimal (Base 16), and Octal (Base 8). Features real-time multi-base synchronization, 4-bit nibble formatting, and step-by-step powers-of-2 mathematical proofs.

|
Last Updated: September 2026
|
IEEE 754 & Positional Radix Standards Verified
Quick-Select Computer Science Values Standard Benchmarks

Synchronous Multi-Base Inputs

0, 1
0–9
0–9, A–F
0–7
8-Bit Binary Nibble Grouping
1111 1111
Formatted as 4-bit nibbles for clean hexadecimal byte alignment.
Bit Length
8 Bits
1 Byte
ASCII Character
ÿ (0xFF)
Latin Extended
Signed 8-Bit
-1
Two's Complement
Powers of 2 Exponent
2⁸ − 1
Mersenne number
2ⁿ

Step-by-Step Binary to Decimal Bit Expansion Proof

Direct Answer & Overview
Verified Educational Guide

How to Convert Binary to Decimal

To convert a binary number to decimal, multiply each binary digit (0 or 1) by 2 raised to the power of its position index (counting from 0 on the far right), then add all the products together. For example, binary 1101 = (1 × 8) + (1 × 4) + (0 × 2) + (1 × 1) = 13 in decimal.

Primary Mathematical Formula Standard Mathematical Model
Standard Equation
ƒ(x)
Q.E.D.
Decimal=∑i=0n−1(bi×2i)=(bn−1×2n−1)+⋯+(b1×21)+(b0×20)\text{Decimal} = \sum_{i=0}^{n-1} \left( b_i \times 2^i \right) = (b_{n-1} \times 2^{n-1}) + \dots + (b_1 \times 2^1) + (b_0 \times 2^0)
Evaluated with exact mathematical formulation • Rigorously verified
Exact Formula
Input Parameters
Required
1
Binary string of 0s and 1s (e.g., 10110)
2
Supports direct entry in Decimal, Hexadecimal, or Octal
Expected Outputs
Calculated
Decimal value (Base 10)
Powers-of-2 mathematical step breakdown
Hexadecimal (Base 16) and Octal (Base 8) equivalents
4-bit nibble formatting and ASCII character lookup
Worked Numerical Example
Instant Verification
Convert binary 1011₂ to decimal
→ (1 × 8) + (0 × 4) + (1 × 2) + (1 × 1) = 8 + 0 + 2 + 1
11 in decimal

What Is Binary and How Does It Work?

In everyday life, humans count in decimal (Base 10), likely because we have ten fingers. Decimal uses ten digits (0 through 9). Once we count past 9, we add another digit column: tens, hundreds, thousands, and beyond.

Computers do not have ten fingers. Instead, their processors are built from billions of tiny electronic switches called transistors. A transistor can only be in one of two physical states: OFF (0) or ON (1). Because of this, computers use the binary (Base 2) number system.

Binary (Base 2) Digits: 0, 1

Computer hardware & bits

Octal (Base 8) Digits: 0–7

Unix file permissions

Decimal (Base 10) Digits: 0–9

Everyday human counting

Hex (Base 16) Digits: 0–9, A–F

Web hex colors & memory

Key Computer Science Terms:
  • Bit: A single binary digit (a 0 or a 1). It is the smallest unit of digital data.
  • Nibble: A group of 4 bits (e.g. 1010). Exactly one hexadecimal character.
  • Byte: A group of 8 bits (e.g. 11110000). Can represent 256 distinct values (0 to 255).

The Binary Place Value Chart (Powers of 2)

The easiest way to understand binary is to use a Place Value Chart. In decimal, each column to the left is multiplied by 10 (1, 10, 100, 1000). In binary, each column to the left is doubled (multiplied by 2):

Power of 2 2⁷ 2⁶ 2⁵ 2⁴ 2³ 2² 2¹ 2⁰
Place Value 128 64 32 16 8 4 2 1
Example Bit 1 1 0 1 0 1 1 0
Value to Add 128 64 0 16 0 4 2 0
Simple 3-Second Rule:

If a column has a 1, keep its place value. If it has a 0, cross it out. Then simply add up all the numbers you kept: 128 + 64 + 16 + 4 + 2 = 214!

How to Convert Binary to Decimal (Step-by-Step)

Here is the foolproof 3-step process to convert any binary number to decimal:

1

Write out powers of 2 from right to left

Start on the far right with 1 (which is 2⁰), then double the value as you move left: 1, 2, 4, 8, 16, 32, 64, 128... Write down as many values as there are digits in your binary number.

2

Write your binary digits underneath

Align each digit of your binary number directly underneath its corresponding power of 2.

3

Add up the numbers with a 1

Multiply each power of 2 by the digit below it (0 or 1). In practice, this just means adding together only the powers of 2 that have a 1 beneath them.

Quick Walkthrough: Convert binary 10110₂ to decimal
• Position 4 (leftmost): 1 × 2⁴ = 1 × 16 = 16
• Position 3: 0 × 2³ = 0 × 8 = 0
• Position 2: 1 × 2² = 1 × 4 = 4
• Position 1: 1 × 2¹ = 1 × 2 = 2
• Position 0 (rightmost): 0 × 2⁰ = 0 × 1 = 0
Decimal Sum: 16 + 0 + 4 + 2 + 0 = 22₁₀

The Fast "Double and Add" Mental Math Method

What if you need to convert a binary number in your head without memorizing high powers of 2? Use the "Double and Add" method (also known in mathematics as Horner's method).

How "Double and Add" Works:

Start at 0. Move through the binary digits one-by-one from left to right: at each step, double your running total and add the current digit.

Example: Convert binary 1101₂ using Double and Add
1. Start with 0. First bit is 1: (0 × 2) + 1 = 1
2. Second bit is 1: (1 × 2) + 1 = 3
3. Third bit is 0: (3 × 2) + 0 = 6
4. Fourth bit is 1: (6 × 2) + 1 = 13
Final Result: 1101₂ = 13₁₀

How to Convert Decimal to Binary (Divide by 2)

To convert a decimal integer back to binary, use the standard Successive Division by 2 algorithm:

  • Divide the decimal number by 2.
  • Note down the integer quotient and the remainder (0 or 1).
  • Repeat the division with the quotient until the quotient reaches 0.
  • Read the remainders from bottom to top (the last remainder is the first bit).
Division Step Quotient Remainder (Bit) Bit Significance
43 ÷ 2 21 1 Least Significant Bit (LSB)
21 ÷ 2 10 1 Bit 1
10 ÷ 2 5 0 Bit 2
5 ÷ 2 2 1 Bit 3
2 ÷ 2 1 0 Bit 4
1 ÷ 2 0 1 Most Significant Bit (MSB)
Reading the remainders from bottom to top gives: 101011₂ = 43₁₀.

Binary to Decimal & Hex Conversion Reference Table

The table below lists all 16 values of a 4-bit nibble (0000 to 1111) with their decimal, hexadecimal, and octal equivalents:

Binary Decimal Hex Binary Decimal Hex
000000100088
000111100199
001022101010A
001133101111B
010044110012C
010155110113D
011066111014E
011177111115F
Essential Powers of 2 in Computing:
2⁷ = 128 ASCII standard
2⁸ = 256 1 Byte (0–255)
2¹⁰ = 1,024 1 Kilobyte (KB)
2¹⁶ = 65,536 16-bit unsigned max

Step-by-Step Worked Numerical Solutions

Example 1: 4-Bit Binary to Decimal Basic Tier

Convert binary 1011₂ to Decimal.

1. Write place values: [8, 4, 2, 1]
2. Match digits: (1 × 8) + (0 × 4) + (1 × 2) + (1 × 1)
3. Add non-zero terms: 8 + 0 + 2 + 1 = 11
Result: 1011₂ = 11₁₀ (Hex: 0x0B)
Example 2: 8-Bit Byte to Decimal & Hex Intermediate Tier

Convert binary 11010110₂ to Decimal and Hexadecimal.

1. Decimal: (1×128) + (1×64) + (0×32) + (1×16) + (0×8) + (1×4) + (1×2) + (0×1)
2. Sum: 128 + 64 + 16 + 4 + 2 = 214₁₀
3. Split into 4-bit nibbles: [1101] [0110]
4. 1101₂ = 13 = 'D'; 0110₂ = 6 = '6'
Result: 11010110₂ = 214₁₀ = 0xD6₁₆
Example 3: Decimal to Binary Division Reverse Conversion

Convert decimal 156₁₀ to Binary.

156 ÷ 2 = 78 R 0
78 ÷ 2 = 39 R 0
39 ÷ 2 = 19 R 1
19 ÷ 2 = 9 R 1
9 ÷ 2 = 4 R 1
4 ÷ 2 = 2 R 0
2 ÷ 2 = 1 R 0
1 ÷ 2 = 0 R 1
Read bottom-to-top: 156₁₀ = 10011100₂

Common Pitfalls & Mistakes to Avoid

Reading Bits in Reverse Direction

The least significant bit (2⁰ = 1) is always on the far right. A common beginner mistake is reading power positions starting from the left.

Forgetting That 2⁰ Equals 1

Any non-zero number raised to the zero power equals 1 (2⁰ = 1). Never multiply the rightmost bit by 0.

Confusing 0x Hex Prefix with Decimal

In programming (JS, Python, C), 0x10 means hexadecimal 16, NOT decimal 10. Always verify the radix prefix.

Pro Tip: Spotting Odd vs. Even Numbers Instantly

Because 2⁰ = 1 is the only odd power of 2, you can tell if any binary number is odd or even in half a second: if the rightmost bit is 1, the number is odd. If the rightmost bit is 0, the number is even!

Fact-Checked & Verified • Computational Accuracy Standards
Updated September 2026 • Editorial Policy
Authored By
Sanjay Samanta

Lead Developer & Founder of Basic Math Tools. Specializes in browser-native computational algorithms and applied mathematics.

Reviewed & Verified By
Academic Review Board

Mathematics & curriculum specialists. Audited against standard algebraic and arithmetic principles.

Found an error or have an improvement suggestion? Report a calculation issue

Frequently Asked Questions

How do you convert a binary number to decimal?
To convert binary to decimal, multiply each binary digit (0 or 1) by 2 raised to the power of its position, starting at position 0 on the far right (the least significant bit). Then, add all the resulting products together. For example, binary 1101 = (1 × 2³) + (1 × 2²) + (0 × 2¹) + (1 × 2⁰) = 8 + 4 + 0 + 1 = 13 in decimal.
What is 1111 1111 in decimal?
Binary 1111 1111 equals 255 in decimal. It represents an 8-bit byte where every bit is set to 1: 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = 255. In hexadecimal, it is written as 0xFF.
Why does binary position counting start at 0 instead of 1?
Positional number systems use the exponent of the base to determine each column's value. The rightmost column represents base 2 raised to power 0 (2⁰ = 1). The next column is 2¹ = 2, then 2² = 4, and so on. Starting at 0 ensures that the first place value represents single units.
How do you convert decimal to binary using division by 2?
Divide the decimal integer by 2 repeatedly and write down the remainder (0 or 1) for each division. Stop when the quotient reaches 0. Then, read all the remainders in reverse order—from the last remainder at the bottom up to the first remainder at the top.
What is the difference between a bit, a nibble, and a byte?
A bit is a single binary digit (either 0 or 1). A nibble consists of 4 bits (representing decimal values 0 to 15, or one hexadecimal digit). A byte consists of 8 bits (representing decimal values 0 to 255, or two hexadecimal digits).
Why do computers use binary instead of decimal?
Computer hardware is built from billions of microscopic semiconductor transistors. A transistor reliably exists in two physical states: OFF (low voltage, representing 0) and ON (high voltage, representing 1). Binary is much more noise-tolerant and physically reliable in electronic circuits than trying to distinguish 10 separate voltage levels.