Binary to Decimal Converter

A binary to decimal converter translates any binary number (base 2) into its decimal equivalent (base 10). This binary to decimal converter online gives you a full positional breakdown so you can see exactly how each conversion works, step by step.

The binary number system uses only two digits: 0 and 1. It is the foundation of all modern digital computing. According to the IEEE (Institute of Electrical and Electronics Engineers), binary arithmetic underpins every processor, memory unit, and data transmission protocol in use today. IEEE 754, the standard that governs floating-point binary arithmetic, is implemented in virtually 100% of modern processors worldwide.

What Is Binary to Decimal Conversion?

Binary to decimal conversion is the process of rewriting a base-2 number as its base-10 equivalent. This is also called base 2 to base 10 conversion. In base 2, each position represents a power of 2 (1, 2, 4, 8, 16...). In base 10, each position represents a power of 10 (1, 10, 100...). Converting any binary code to decimal means summing the positional values of all 1-bits in the number.

Computers store every number, character, and instruction in binary. A memory address, a file size in bytes, a color code like #FF5733, all trace back to binary at the hardware level. Knowing how to convert binary to decimal bridges the gap between machine-level data and human-readable numbers.

Binary to Decimal Formula

The binary to decimal formula multiplies each digit by its positional power of 2, then sums all results:

Decimal = d0 x 2^0 + d1 x 2^1 + d2 x 2^2 + d3 x 2^3 + ...

Where d0 is the rightmost (least significant) digit and each position increases by one power of 2 moving left.

Example, converting 1101 binary to decimal:

Total: 8 + 4 + 0 + 1 = 13. So 1101 in binary = 13 in decimal. The binary to decimal formula gives an exact result every time for any integer input.

How to Convert Binary to Decimal

Follow these steps to convert any binary number to decimal without a calculator:

1. Write the binary number and label each digit from right to left, starting at position 0.
2. For each digit that is 1, calculate 2 raised to that position number (2^0=1, 2^1=2, 2^2=4, 2^3=8, 2^4=16, and so on).
3. Ignore all digits that are 0, they contribute nothing to the total.
4. Add all the values from step 2 together. The result is the decimal equivalent.

This method works for any binary number regardless of length. The binary to decimal examples below cover the most searched specific values. Each binary to decimal conversion examples section shows the full calculation step by step. The DigiCalc binary to decimal calculator performs every step automatically and displays the positional breakdown below the result.

Binary to Decimal Conversion Table

This binary to decimal chart covers the most commonly referenced values from 0 to 255, the full 8-bit unsigned range used in byte-level computing. Use this binary to decimal table for quick reference without a calculator.

The value 255 (11111111 in binary) is the maximum for an 8-bit byte and appears throughout networking, image processing, and color encoding. For values beyond 255, use the binary to decimal converter above, it handles any bit length instantly.

101 Binary to Decimal

101 in binary equals 5 in decimal. The rightmost digit (1) gives 1, the middle digit (0) gives 0, and the leftmost digit (1) gives 4. Adding: 4 + 0 + 1 = 5. The binary number 101 is one of the most searched binary values. It appears in introductory computer science courses as a classic 3-bit binary to decimal example.

1011 Binary to Decimal

1011 in binary equals 11 in decimal. Working right to left: 1x1 = 1, 1x2 = 2, 0x4 = 0, 1x8 = 8. Sum: 8 + 0 + 2 + 1 = 11. The binary number 1011 is frequently used in logic gate exercises. Three of its four bits are set, making the positional addition easy to verify step by step.

1001 Binary to Decimal

1001 in binary equals 9 in decimal. The two outer 1-bits occupy positions 3 and 0, contributing values of 8 and 1 respectively. The inner 0-bits at positions 2 and 1 add nothing. Total: 8 + 0 + 0 + 1 = 9. This outer-ones, inner-zeros pattern makes 1001 binary to decimal a classic example for teaching how positional notation skips zero-bit values.

110 Binary to Decimal

110 in binary equals 6 in decimal. The rightmost digit (0) contributes 0, the middle digit (1) contributes 2, and the leftmost digit (1) contributes 4. Sum: 4 + 2 + 0 = 6. The binary pattern 110 appears in Unix file permissions. Read and write access (no execute) maps directly to this 3-bit binary value in computing systems.

100 Binary to Decimal

100 in binary equals 4 in decimal. Only the leftmost digit is 1, sitting at position 2. Its value is 2^2 = 4. The two zeros contribute nothing. This 100 binary to decimal example shows a key rule: a single 1 followed by all zeros always equals a power of 2.

11111 Binary to Decimal

11111 in binary equals 31 in decimal. Each of the five 1-bits adds its positional value: 16 + 8 + 4 + 2 + 1 = 31. There is a useful shortcut for 11111 binary to decimal: all-ones binary numbers equal 2^n minus 1, where n is the digit count. Five 1-bits = 2^5 minus 1 = 31. The same rule gives 111 = 7, 1111 = 15, and 11111111 = 255.

10101 Binary to Decimal

10101 in binary equals 21 in decimal. The alternating 1-bits sit at positions 4, 2, and 0, giving values 16, 4, and 1. Sum: 16 + 4 + 1 = 21. This alternating-bit pattern is used in signal integrity testing and data transmission diagnostics. It verifies that all bit channels in a digital bus are functioning independently.

11111111 Binary to Decimal

11111111 binary to decimal equals 255. This is the largest value an 8 bit binary to decimal conversion can produce. All eight positions hold a 1: 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = 255. This is why a single byte represents values from 0 to 255, the range used for color channels and unsigned characters.

1010 in Decimal

1010 in decimal equals 10. Only the bits at positions 3 and 1 are set, giving 8 + 2 = 10. This is one of the most common practice values because its decimal result matches its visual digit count, making it easy to verify by hand.

11110 Binary to Decimal

11110 binary to decimal equals 30. The four leftmost bits are set at positions 4, 3, 2, and 1: 16 + 8 + 4 + 2 = 30. The trailing zero contributes nothing, so dropping it would change the value to 1111, which equals 15.

10011 Binary to Decimal

10011 binary to decimal equals 19. The set bits sit at positions 4, 1, and 0: 16 + 2 + 1 = 19. This pattern shows how widely spaced 1-bits combine a large place value with two small ones.

Binary Coded Decimal (BCD) Explained

Binary Coded Decimal (BCD) encodes each decimal digit as a separate 4-bit binary group. This is different from standard binary to decimal conversion, which converts the entire number at once.

Standard binary vs. BCD, converting decimal 93:

In BCD binary coded decimal format, the digit 9 becomes 1001 and the digit 3 becomes 0011. The final BCD representation is 1001 0011, two separate 4-bit groups. BCD is longer than standard binary but preserves individual decimal digits, making arithmetic and display logic simpler in hardware. A binary coded decimal converter processes each digit separately rather than converting the whole number at once.

BCD is widely used in digital clocks, cash registers, point-of-sale terminals, and financial computing where rounding errors from floating-point binary must be avoided. The BCD standard is defined under IEEE digital arithmetic specifications that govern how computing devices handle decimal representation at the hardware level.

Binary Fraction to Decimal Conversion

Binary fraction to decimal conversion uses negative powers of 2 for each digit after the binary point. The first fractional bit uses 2^-1 = 0.5, the second uses 2^-2 = 0.25, the third uses 2^-3 = 0.125, and so on.

Example, binary fraction to decimal for 0.1011:

Total: 0.5 + 0 + 0.125 + 0.0625 = 0.6875. So 0.1011 in binary = 0.6875 in decimal.

Some decimal fractions, such as 0.1 and 0.3, have no exact binary representation and produce infinitely repeating binary sequences. This is why programming environments following the IEEE 754 floating-point standard can display results like 0.1 + 0.2 = 0.30000000000000004 rather than exactly 0.3. The issue is an inherent property of representing base-10 fractions in base-2, not a software bug.

Real-World Uses of Binary to Base 10 Conversion

Binary to base 10 conversion appears across multiple technical fields in everyday computing and electronics:

• Computer programming: Memory addresses, RGB color values (0 to 255 per channel), and IPv4 subnet masks are expressed in binary. Unix permissions like chmod 755 equal 111 101 101 in binary. Developers read these values in decimal.
• Digital electronics: Microcontrollers and sensors output binary register values. Engineers convert binary to decimal results to verify readings, set configuration flags, and debug hardware registers.
• Data storage and networking: Hard drive sectors, RAM addressing, and network packet headers are organized in binary. IT professionals convert binary strings to decimal when reading raw data dumps or protocol captures.
• Cryptography and encoding: ASCII encodes the letter A as 01000001 in binary, which equals 65 in decimal. Hash functions and encryption keys also operate in binary. Security analysts move between binary decimal hexadecimal representations to examine encoded data.

To reverse any conversion, use DigiCalc's decimal to binary converter. For hexadecimal values, the hex to decimal converter handles base-16 inputs directly. Browse the full number converter collection for octal, binary, hex, and decimal tools in one place.

Why Computers Use Binary Instead of Decimal

Computers store and process every value in binary because electronic circuits have two reliable states: on and off, represented as 1 and 0. A decimal system would need ten distinct voltage levels per digit, which is far harder to build accurately and far more prone to error. Two states are simple to detect, simple to switch, and resistant to electrical noise, so binary became the natural language of hardware.

This is why binary to decimal conversion matters so often. Machines work in base 2, but people read and reason in base 10. A sensor reading, a memory address, or a network packet starts as a binary value. Before a person sees it, that value is translated into a familiar decimal number. The converter above performs that exact translation, giving you the same positional result a processor computes internally.

Understanding this gap also explains why programmers frequently switch between bases. Hexadecimal groups four binary digits into one symbol, making long binary strings shorter to read, while decimal stays the most intuitive for everyday math. Knowing how base 2 maps to base 10 is the foundation for reading memory dumps, debugging low level code, and interpreting raw data.

Common Mistakes When Converting Binary to Decimal

The most frequent error is reading the bits in the wrong direction. Place values increase from right to left, so the rightmost digit is always 2 to the power of 0, not the leftmost. Beginners who start weighting from the left produce a mirror image of the correct answer. Double checking the least significant bit first is a reliable habit.

A second common slip is miscounting the exponent. With an eight bit number the leftmost position is 2 to the power of 7, equal to 128. It is easy to write 2 to the power of 8 by accident. A short conversion table, like the one above, removes this risk because each column already shows its exact place value. Finally, watch for leading zeros: they never change the decimal result at all, so 00101 and 101 both equal the same decimal value of 5.

Our binary to decimal conversion calculator handles every case shown above. The conversion of base 2 to base 10 takes a single click instead of manual work. Programmers often line up binary decimal octal hexadecimal values side by side when reading memory. Each base offers a different view of the same bits. The tool also clarifies the reverse direction: going from bcd to binary regroups the 4-bit decimal codes back into a single continuous binary string.

Limitations of This Binary to Decimal Converter

• Unsigned integers only: This binary to decimal converter uses unsigned notation. The binary string 11111111 equals 255 unsigned, but represents -1 in signed 8-bit two's complement. If working with signed binary, apply two's complement rules before entering the value.
• Fractional precision: Not all decimal fractions have exact binary representations. Decimal 0.1 produces an infinitely repeating binary sequence. The converter rounds fractional results to a practical precision level.
• BCD inputs: This tool converts standard binary, not BCD. A binary coded decimal converter must split each 4-bit group and convert individually. If your input uses BCD encoding, split it into individual groups and convert each group separately.
• No floating-point format: The converter handles positional binary numbers but does not interpret IEEE 754 floating-point binary encoding. For floating-point analysis, a dedicated IEEE 754 decoder is required.

For practical data size conversions, use DigiCalc's data storage converter to switch between bytes, kilobytes, megabytes, gigabytes, and terabytes.