Binary to Decimal Converter
Calculate binary decimal instantly with our math tool. Shows detailed work, formulas used, and multiple solution methods.
Calculator
Adjust values & calculateEnter only 0s and 1s. The 0b prefix is optional.
Formula
Each binary digit (0 or 1) is multiplied by 2 raised to the power of its position, counting from 0 on the right. The results are summed to produce the decimal equivalent.
Last reviewed: December 2025
Worked Examples
Example 1: 8-bit Binary to Decimal
Example 2: Binary IP Address Octet
Background & Theory
The Binary to Decimal Converter applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Binary to Decimal Converter traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
Sources & References
Formula
Decimal = sum of (bit x 2^position) for each binary digit
Each binary digit (0 or 1) is multiplied by 2 raised to the power of its position, counting from 0 on the right. The results are summed to produce the decimal equivalent.
Worked Examples
Example 1: 8-bit Binary to Decimal
Problem: Convert the binary number 11010110 to decimal.
Solution: Position values from right to left:\n1 x 2^7 = 128\n1 x 2^6 = 64\n0 x 2^5 = 0\n1 x 2^4 = 16\n0 x 2^3 = 0\n1 x 2^2 = 4\n1 x 2^1 = 2\n0 x 2^0 = 0\nSum: 128 + 64 + 0 + 16 + 0 + 4 + 2 + 0 = 214
Result: 11010110 (binary) = 214 (decimal) = D6 (hex)
Example 2: Binary IP Address Octet
Problem: Convert the binary value 11000000 (first octet of 192.168.x.x) to decimal.
Solution: 1 x 128 = 128\n1 x 64 = 64\n0 x 32 = 0\n0 x 16 = 0\n0 x 8 = 0\n0 x 4 = 0\n0 x 2 = 0\n0 x 1 = 0\nSum: 128 + 64 = 192\nThis confirms the first octet of the common private IP range.
Result: 11000000 = 192 (the start of the 192.168.x.x private range)
Frequently Asked Questions
What is the binary number system and why do computers use it?
The binary number system (base-2) uses only two digits: 0 and 1. Computers use binary because digital electronic circuits have two stable states: on (represented as 1) and off (represented as 0). These states are easy to distinguish electrically, making binary highly reliable for data processing and storage. Every piece of data in a computer, from text and images to videos and software, is ultimately represented as sequences of binary digits (bits). While humans find decimal more intuitive, binary is the natural language of digital hardware. Understanding binary is essential for computer science, networking, and any field involving digital technology.
How do you convert decimal to binary?
To convert decimal to binary, repeatedly divide the number by 2 and record the remainders. Read the remainders from bottom to top to get the binary number. For example, converting 214: 214 divided by 2 = 107 remainder 0, 107 divided by 2 = 53 remainder 1, 53 divided by 2 = 26 remainder 1, 26 divided by 2 = 13 remainder 0, 13 divided by 2 = 6 remainder 1, 6 divided by 2 = 3 remainder 0, 3 divided by 2 = 1 remainder 1, 1 divided by 2 = 0 remainder 1. Reading bottom to top: 11010110. You can verify by converting back to decimal. This division method works for any positive integer.
How does binary relate to hexadecimal and octal?
Binary, hexadecimal, and octal are related because their bases are all powers of 2. Hexadecimal (base 16 = 2^4) maps each digit to exactly 4 binary digits, and octal (base 8 = 2^3) maps each digit to exactly 3 binary digits. This makes conversion between these bases trivial. To convert binary 11010110 to hex, group into fours from right: 1101 0110 = D6. For octal, group into threes: 11 010 110 = 326. These groupings make hex and octal convenient shorthands for binary. Hexadecimal is most common in modern computing because it aligns with byte boundaries (2 hex digits = 1 byte), while octal was historically used in older Unix systems.
What are binary arithmetic operations?
Binary arithmetic follows simple rules. For addition: 0+0=0, 0+1=1, 1+0=1, 1+1=10 (carry 1). For subtraction, borrowing works like decimal but in base 2. Multiplication is straightforward since you only multiply by 0 or 1. Binary shifts are special operations: left shift (adding a 0 on the right) multiplies by 2, and right shift (removing the rightmost bit) divides by 2. Logical operations AND, OR, XOR, and NOT operate on individual bits and are fundamental to computer processing. These operations are executed directly by hardware circuits called logic gates, making them extremely fast and efficient.
How is binary used in networking and IP addresses?
Binary is essential in networking, particularly for IP addresses and subnet masks. An IPv4 address like 192.168.1.100 is actually four 8-bit binary numbers: 11000000.10101000.00000001.01100100. Subnet masks use binary to separate the network and host portions of an address. For example, a /24 subnet mask is 11111111.11111111.11111111.00000000 (255.255.255.0). Routers perform bitwise AND operations between IP addresses and subnet masks to determine network membership. Understanding binary is crucial for network administrators when planning subnets, troubleshooting connectivity, and configuring access control lists. IPv6 uses 128-bit addresses, making binary understanding even more important.
What is binary-coded decimal (BCD) and when is it used?
Binary-coded decimal represents each decimal digit with its 4-bit binary equivalent. For example, the decimal number 92 in BCD is 1001 0010 (9 = 1001, 2 = 0010), whereas in pure binary 92 is 1011100. BCD wastes some bit combinations (1010 through 1111 are unused) but makes decimal display straightforward. BCD is used in digital clocks, calculators, financial systems, and any application where exact decimal representation is important. Financial calculations use BCD to avoid rounding errors that occur with floating-point binary representation. It is also used in older mainframe systems and in communication protocols that transmit decimal data.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy