CalcUnit Logo
Converters

Binary Math: How to Add, Subtract, and Multiply 1s and 0s

Learn how the CPU in your computer actually does math. We explain the simple rules for carrying 1s when adding and subtracting in Base-2 binary.

CSBy CalcUnit Computer Science ExpertsPublished 8 min read
Binary Math: How to Add, Subtract, and Multiply 1s and 0s

Instantly calculate massive binary equations without manual base-conversion using our Binary Calculator, or read on to learn how to do the math on paper.

In the Base-10 decimal system that humans use, we have ten digits (0 through 9). When we add numbers and hit the maximum digit of 9, we carry a "1" over to the next column.

Computers use the Base-2 binary system, which only has two digits: 0 and 1. This means the mathematical rules for addition and subtraction trigger the "carrying" rule much faster, but the logic remains exactly the same.

Binary Place Values

Before doing arithmetic, it helps to see what each position is worth. In decimal, columns are worth 1, 10, 100, 1000. In binary, each column doubles: 1, 2, 4, 8, 16, 32, 64, 128.

Bit position 8th 7th 6th 5th 4th 3rd 2nd 1st
Place value 128 64 32 16 8 4 2 1

To read a binary number, add the place values wherever a 1 appears. The number 1101 means 8 + 4 + 0 + 1 = 13 in decimal. Every conversion trick in this article rests on that one idea.

Run your own numbers

Enter your own numbers and see the result instantly — free, no signup.

Open the Calculator →

Binary Addition

There are only four possible combinations when adding two single binary digits (bits):

  1. 0 + 0 = 0
  2. 1 + 0 = 1
  3. 0 + 1 = 1
  4. 1 + 1 = 0 (and you carry a 1 to the next column).

Wait, why does 1 + 1 equal 0? Because the number 2 does not exist in binary. In decimal, 1 + 1 = 2. In binary, the decimal number 2 is written as 10. Therefore, you write down the 0, and carry the 1.

Example: Adding 1011 and 1101

Let's add these vertically from right to left. 1 0 1 1 (Decimal 11) + 1 1 0 1 (Decimal 13)

Column 1 (Right): 1 + 1 = 0 (Carry 1) Column 2: 1 + 0 + (carried 1) = 0 (Carry 1) Column 3: 0 + 1 + (carried 1) = 0 (Carry 1) Column 4 (Left): 1 + 1 + (carried 1) = 1 (Carry 1 to a new 5th column)

Result: 11000 (Decimal 24).

Example: A Shorter Addition

Not every problem carries so aggressively. Try 111 + 110 (decimal 7 + 6).

Column 1: 1 + 0 = 1 Column 2: 1 + 1 = 0 (Carry 1) Column 3: 1 + 1 + (carried 1) = 1 (Carry 1) Column 4: The final carry stands alone as 1.

Result: 1101 (Decimal 13). Checking in decimal — 7 + 6 = 13 — confirms the binary answer is right.

Binary Subtraction

Binary subtraction is slightly trickier because it requires "borrowing," just like in decimal math when you try to subtract a larger number from a smaller one.

There are four basic rules for subtracting bits:

  1. 0 - 0 = 0
  2. 1 - 1 = 0
  3. 1 - 0 = 1
  4. 0 - 1 = 1 (but you must borrow a 1 from the next column to the left).

When you borrow a 1 from the next column, the current column temporarily becomes 10 (which is 2 in decimal). 2 - 1 = 1.

Example: Subtracting 101 from 110

1 1 0 (Decimal 6) - 1 0 1 (Decimal 5)

Column 1 (Right): 0 - 1. You cannot do this. You borrow from Column 2. The 0 becomes 10 (2). 2 - 1 = 1. Column 2: The 1 was borrowed, so it is now 0. 0 - 0 = 0. Column 3 (Left): 1 - 1 = 0.

Result: 001 (Decimal 1).

Example: Subtracting with a Bigger Gap

Now try 1100 - 0110 (decimal 12 − 6).

Column 1: 0 - 0 = 0 Column 2: 0 - 1. Borrow from Column 3, turning this column into 10 (2). 2 - 1 = 1. Column 3: After lending, it holds 0.

0 - 1. Borrow from Column 4, making it 10 (2). 2 - 1 = 1. Column 4: After lending, it holds 0. 0 - 0 = 0.

Result: 0110 (Decimal 6), which matches 12 − 6 = 6.

Binary Multiplication

Binary multiplication is surprisingly easy because you are only ever multiplying by 0 or 1.

  • Multiplying by 0 equals 0.
  • Multiplying by 1 equals the number itself.

It works exactly like standard long multiplication, but the addition at the end is much simpler!

Example: Multiplying 101 by 101

This is decimal 5 × 5. Write one partial product for each digit of the second number, shifting left each time.

  • 101 × 1 = 101
  • 101 × 0 = 000 (shifted one place)
  • 101 × 1 = 101 (shifted two places)

Add the partial products: 101 + 10100 = 11001. The result, 11001, equals 16 + 8 + 0 + 0 + 1 = 25 in decimal. Correct: 5 × 5 = 25.

A useful shortcut hides here. Multiplying a binary number by 2 simply shifts every digit one place left and adds a zero — exactly like multiplying a decimal number by 10.

Binary Division in Brief

Division is the operation people ask about least, because paper-and-pencil binary division is tedious — but the logic is just repeated comparison and subtraction.

Divide 1100 (12) by 11 (3). Ask: does 3 fit into 12? Yes, 4 times with nothing left over. Build the quotient bit by bit, and the answer is 100 — which is 4. Correct.

Computers perform division with shift-and-subtract routines related to the same adder hardware. In practice, you will almost never do long binary division by hand; the point is knowing it follows the same rules as decimal long division, just with a much smaller multiplication table.

Overflow: When the Bits Run Out

Every real computer stores numbers in a fixed number of bits, and that creates a failure mode paper math never has: overflow.

A 4-bit register holds values from 0 (0000) to 15 (1111). Add 15 + 1 and the true answer, 16, needs five bits (10000). In a 4-bit register the extra bit has nowhere to go, and the stored result wraps to 0000.

That wraparound is why old video games and software had famous glitches at values like 255 rolling over to 0. Programmers choose register sizes — 8, 16, 32, 64 bits — so that overflow stays far away from realistic values.

When you verify binary work by converting to decimal, an answer that suddenly looks tiny is often an overflow you failed to notice.

How Computers Really Subtract: Two's Complement

Modern computer processors (CPUs) do not actually have subtract, multiply, or divide circuits. They only have adder circuits. To subtract, the CPU converts the second number into a negative using a method called "Two's Complement," and then simply adds the negative number to the first number!

Here is how it works in 8 bits. To represent −5:

  1. Start with 5: 00000101
  2. Flip every bit: 11111010
  3. Add 1: 11111011

Now add 9 + (−5) using that code: 00001001 + 11111011 = 100000100. The ninth bit overflows beyond 8 bits and is discarded, leaving 00000100 — which is 4. The adder circuit just performed subtraction without knowing it.

Common Mistakes to Avoid

Binary arithmetic is simple, but a few habits reliably cause wrong answers.

  • Forgetting the carry. In binary, carries happen constantly — far more often than in decimal. Track them above each column.
  • Working left to right. Always start from the rightmost digit, just as in decimal column arithmetic.
  • Misreading the result. Leading zeros mean nothing (0110 is just 6), but dropping an internal zero changes the value completely.
  • Skipping the decimal check. Convert both inputs and your answer to decimal to confirm the arithmetic. Our Decimal to Binary Converter makes that check instant.

Connecting Binary to Hexadecimal

Binary strings grow long fast, so programmers group bits in fours and read each group as one hexadecimal digit. The binary number 11111111 becomes FF — two characters instead of eight.

That is why fluency in binary also unlocks hex. If this grouping idea interests you, our Hexadecimal to Decimal Converter shows the other half of the system.

FAQ

How do computers subtract if they only have adding circuits? Modern computer processors (CPUs) do not actually have subtract, multiply, or divide circuits. They only have adder circuits. To subtract, the CPU converts the second number into a negative using a method called "Two's Complement," and then simply adds the negative number to the first number!

What is the difference between a bit and a byte? A bit is a single 0 or 1. A byte is a group of 8 bits, which can represent 256 different values, from 0 (00000000) to 255 (11111111). File sizes are measured in bytes; network speeds are usually measured in bits.

Why do computers use binary at all? Because a single electrical switch has two natural states: off and on. Building reliable hardware around two states is far easier than distinguishing ten voltage levels for decimal digits. Every higher-level system — text, images, video — is layers of abstraction on top of those two states.

Can binary represent fractions and negative numbers? Yes. Negative numbers usually use Two's Complement, as shown above. Fractions use a binary version of the decimal point, where digits to the right are worth 1/2, 1/4, 1/8, and so on — the system behind floating-point numbers like 0.1 storage quirks.


Avoid the headache of borrowing and carrying 1s. Process complex binary, hex, and octal math instantly using the CalcUnit Binary Calculator.

NameBinary Math: How to Add, Subtract, and Multiply 1s and 0s
DescriptionLearn how the CPU in your computer actually does math. We explain the simple rules for carrying 1s when adding and subtracting in Base-2 binary.
PublishedJune 12, 2026 · CalcUnit Computer Science Experts
Filed underconverters · binary to decimal

Keep Reading

Decoding Hexadecimal: Converting Base-16 to Decimal
Converters

Decoding Hexadecimal: Converting Base-16 to Decimal

Learn how to manually translate hexadecimal color codes and MAC addresses back into standard Base-10 numbers using the power-of-16 positional system.

Jun 12, 2026CalcUnit Computer Science Experts