Binary Arithmetic Without the Headache

Binary looks harder than it is. Decimal addition asks you to hold a table of a hundred digit pairs in your head; base 2 asks for four. What actually slows people down is reading a long run of ones and zeros at speed, and that part takes about five minutes to learn.

Reading a binary number in ten seconds

Write the place values above the digits, doubling as you move left: 128, 64, 32, 16, 8, 4, 2, 1. Add up the columns that hold a 1 and ignore the rest.

Take 10110110. The ones sit in the 128, 32, 16, 4 and 2 columns. Add them: 128 + 32 + 16 + 4 + 2 = 182. That is the whole method, and it works for any length as long as you keep doubling the place values.

Going the other way by halving

To convert 182 back, divide by two repeatedly and write down each remainder. 182 gives 91 remainder 0, then 45 remainder 1, 22 remainder 1, 11 remainder 0, 5 remainder 1, 2 remainder 1, 1 remainder 0, and finally 0 remainder 1. Read the remainders bottom to top and you have 10110110 again. It is mechanical, and it is exactly what the calculator does internally. Writing the same quantity in a different system is the same habit as converting between units.

Arithmetic in base 2

Addition has four rules and no more. 0+0 is 0, 0+1 is 1, 1+0 is 1, and 1+1 is 0 carry 1.

Add 1011 and 0110. Rightmost column: 1 + 0 = 1. Next: 1 + 1 = 0, carry 1. Next: 0 + 1 plus the carried 1 = 0, carry 1. Leftmost: 1 + 0 plus the carry = 0, carry 1, which becomes a new leading digit. Result 10001. Check it in decimal: 11 + 6 = 17, and 10001 is 16 + 1 = 17.

Negative numbers and two's complement

Computers do not store a minus sign. In 8-bit two's complement, a negative value is 256 minus the magnitude. So -5 is 256 - 5 = 251, which in binary is 11111011. The top bit acts as the sign flag, giving a range of -128 to 127 rather than 0 to 255.

The elegance is that subtraction becomes addition. 12 - 5 is 12 + (-5): 00001100 + 11111011 = 100000111, and the ninth bit falls off the end of an 8-bit register, leaving 00000111, which is 7. One circuit does both operations.

Using the binary calculator

Choose the input base first. If the tool has a base selector, set it to 2 before typing or it will read 1011 as one thousand and eleven. Enter digits without spaces, though many calculators tolerate the four-digit grouping that makes long strings readable.

Then pick the operation and, for subtraction, check the bit width. An 8-bit setting wraps at 255 and gives the two's complement result above; an unlimited setting returns a plain negative binary number with a minus sign. Both answers are correct in their own context.

The conversion field is where most people spend their time. Paste a decimal to get binary, or binary to get decimal, and check work you did by hand. Systems built on other principles, like Roman numerals, need a real lookup; base conversion is pure arithmetic.

Common questions

Why do computers use binary at all? Because a circuit can tell the difference between voltage present and voltage absent reliably, at billions of times per second. Distinguishing ten separate voltage levels is possible but far more fragile, and the error rate would be unacceptable.

What is the largest number in 8 bits? 255 if the value is unsigned, which is 11111111, or every place value from 128 down to 1 added together. If the bits are signed the range becomes -128 to 127, because one bit is spent on the sign. That 255 ceiling is why colour channels and IP address octets stop where they do.

How do hexadecimal and binary fit together? Each hex digit maps to exactly four bits, which makes hex a compact way of writing binary. Split 10110110 into 1011 and 0110, which are B and 6, so the byte is B6. Convert straight to decimal and you get 182 either way.

Can binary have a fractional part? Yes. Digits after the point are halves, quarters, eighths and so on, so 0.101 is 0.5 + 0.125 = 0.625. Some decimals never terminate in binary, which is why 0.1 cannot be stored exactly in a computer.