Every computer on earth counts in binary — strings of 0s and 1s — while humans count in decimal. Binary to decimal explained simply means learning to translate between the two: turning 110101 into 53. It is one of the first skills in any computer science course, and this guide teaches it two ways: the standard positional method, and Horner’s doubling trick — the fast mental-math method most tutorial sites never mention.
You will also get a printable powers-of-2 reference table and eight practice problems with fully worked answers (all verified — check your work against our free Number Base Converter when you are done).
Table of Contents
- Binary to Decimal Conversion: Positional Notation (The Standard Way)
- Method 2: Horner’s Doubling Trick (Fast Mental Math)
- Powers-of-2 Reference Table
- Binary to Decimal Explained: Three Worked Examples
- Practice Problems (With Answers)
- Common Mistakes to Avoid
- Try It: Number Base Converter
- Frequently Asked Questions
Binary to Decimal Conversion: Positional Notation (The Standard Way)
If you want binary to decimal explained from first principles, start here: the positional method is the binary to decimal conversion formula every textbook teaches. The idea: each position in a binary number represents a power of 2, starting from 20 = 1 on the right. Wherever you see a 1, add that position’s value; wherever you see a 0, add nothing.
Take 1011. Label each digit’s place value from right to left:
1 0 1 1
8 4 2 1 ← place values
Now add the place values under the 1s: 8 + 0 + 2 + 1 = 11. So 1011 in binary is 11 in decimal.
One more, slightly longer: 1100100. Place values from the right: 64, 32, 16, 8, 4, 2, 1. The 1s sit under 64, 32, and 4: 64 + 32 + 4 = 100. That is the whole method — no memorization beyond the powers of 2, which is why the reference table below exists.
Why this works is worth ten seconds: decimal works exactly the same way, with powers of 10. The number 342 means 3×100 + 4×10 + 2×1. Binary is the same idea with powers of 2 instead of powers of 10. Once you see that, binary to decimal conversion stops feeling like a trick and starts feeling like arithmetic — because it is.
Method 2: Horner’s Doubling Trick (Fast Mental Math)
Here is the method most tutorials skip, and it is the better one for mental math. For many learners, binary to decimal explained through doubling clicks faster than place values ever do. Horner’s method: start with 0, then read the binary digits left to right. For each digit, double your running total and add the digit. That is the entire algorithm.
Convert 110101 to decimal with Horner’s method:
- Start: 0
- See
1: 0 × 2 + 1 = 1 - See
1: 1 × 2 + 1 = 3 - See
0: 3 × 2 + 0 = 6 - See
1: 6 × 2 + 1 = 13 - See
0: 13 × 2 + 0 = 26 - See
1: 26 × 2 + 1 = 53
Answer: 53 — no powers of 2 needed, no place-value table, just doubling and adding as you scan left to right. Try it on 1011: 0→1→3→6→ wait, let us trace: start 0; 1: 1; 0: 1×2+0=2; 1: 2×2+1=5; 1: 5×2+1=11. 11 — matches the positional method.
Why does doubling work? Each time you move one position left in binary, the digit’s value doubles — that is what “base 2” means. Horner’s method just applies that fact incrementally instead of computing all the place values up front. For numbers longer than 5–6 bits, it is dramatically faster in your head, because you never juggle large powers of 2. This is also how computers themselves parse binary strings — the algorithm is genuinely how it is done in hardware and software, not just a study trick.
Powers-of-2 Reference Table
For the positional method, keep these handy. The first eight cover a full byte (8 bits, values 0–255):
- 20 = 1
- 21 = 2
- 22 = 4
- 23 = 8
- 24 = 16
- 25 = 32
- 26 = 64
- 27 = 128
- 28 = 256
- 29 = 512
- 210 = 1024
Two landmarks worth memorizing: 11111111 (eight 1s) = 255, the largest value in one byte; and 100000000 (1 followed by eight 0s) = 256. Notice the pattern: a 1 followed by n zeros is always 2n. Spotting that instantly converts numbers like 100000 (32) without any arithmetic.
Binary to Decimal Explained: Three Worked Examples
With binary to decimal explained two different ways, let us put both methods side by side on the same numbers, so you can feel the difference.
Example 1: 1001
Positional: place values 8, 4, 2, 1. The 1s are under 8 and 1: 8 + 1 = 9.
Horner: 0 → 1 → 2 → 4 → 9. 9.
Example 2: 10001110
Positional: place values 128, 64, 32, 16, 8, 4, 2, 1. The 1s are under 128, 8, 4, 2: 128 + 8 + 4 + 2 = 142.
Horner: 0 → 1 → 2 → 4 → 8 → 17 → 35 → 71 → 142. 142. Notice how Horner never asks you to remember that the leftmost bit is worth 128 — it just doubles.
Example 3: 11110000
Positional: 1s under 128, 64, 32, 16: 128 + 64 + 32 + 16 = 240.
Horner: 0 → 1 → 3 → 7 → 15 → 30 → 60 → 120 → 240. 240.
All three answers verified by direct computation. Pick whichever method feels natural — they always agree, because they are the same mathematics done in a different order.
Practice Problems (With Answers)
Cover the answers, solve each one (Horner’s method recommended for the longer ones), then check. Every answer below was verified by computation. Finish all eight and you will have binary to decimal explained in muscle memory, not just on paper.
10100111111111000000001010101110101(from the Horner walkthrough — do it without looking)10011111000010001110
Answers: (1) 20 — 16 + 4. (2) 255 — all eight bits set, the max one-byte value. (3) 256 — 1 followed by eight zeros is 28. (4) 85 — 64 + 16 + 4 + 1. (5) 53. (6) 9. (7) 240. (8) 142. If you got 6 or more, you have the skill; the misses are worth re-tracing with Horner’s method to find where the doubling slipped.
Common Mistakes to Avoid
Even with binary to decimal explained clearly, five classic mistakes trip up beginners. Watch for them and your accuracy will jump immediately.
- Reading right-to-left place values wrong. The rightmost digit is 20 = 1, not 21. Off-by-one-position errors are the #1 beginner mistake — every place value shifts and the answer doubles or halves.
- Confusing binary with decimal-looking numbers.
1010is not “one thousand ten” — it is four bits. Say “one-zero-one-zero” until the habit sticks. - Forgetting that leading zeros change nothing.
00101=101= 5. Leading zeros are padding, not value. - Mixing up binary-to-decimal with decimal-to-binary. Going the other direction uses repeated division by 2, a different algorithm. If your answers keep coming out wrong, check you are converting the right direction.
- Assuming 8 bits is a hard limit. Binary numbers can be any length — 12-bit, 16-bit, 32-bit values are everywhere in computing. The methods here work for any length.
Try It: Number Base Converter
Now that you have binary to decimal explained and practiced, make verification the habit that keeps the skill sharp. Our free Number Base Converter converts between binary, decimal, octal, and hexadecimal instantly — use it to check every practice problem above. If you work with binary-encoded text rather than numbers, the Binary Translator converts binary to readable text and back, and the Base64 encoder shows how binary data gets represented as text for email and web use. The number system itself is documented on Wikipedia’s binary number page.
Frequently Asked Questions
How do you convert binary to decimal?
Two ways. Positional method: label each bit with its power of 2 from the right (1, 2, 4, 8…) and add the values under the 1s. Horner’s method: start at 0, read bits left to right, and for each bit double your total and add the bit. Both give the same answer; Horner is faster for mental math. That is binary to decimal explained in one paragraph — pick a method and practice it.
What is the formula for binary to decimal?
For an n-bit binary number b(n-1)…b1 b0, the decimal value is the sum of bi x 2^i for each bit position i, counting from 0 at the right. In plain words: add up the powers of 2 for every position holding a 1. Example: 1011 = 1×8 + 0x4 + 1×2 + 1×1 = 11.
What is 1011 in decimal?
11. The 1s sit in the 8, 2, and 1 positions: 8 + 2 + 1 = 11. (With Horner’s method: 0 to 1 to 2 to 5 to 11.)
What is the fastest way to convert binary to decimal in your head?
Horner’s doubling method: start at 0, scan left to right, and for each bit double the running total and add the bit. It needs no memorized powers of 2 and no place-value table, and it is how computers parse binary strings internally.