How Binary Arithmetic Works (Add, Subtract, Multiply)

Binary arithmetic performs the four basic operations on numbers written in base 2. Each digit (bit) is 0 or 1. Moving one position left multiplies value by 2, just as base 10 multiplies by 10. The bit string 1011 means 1×8 + 0×4 + 1×2 + 1×1 = 11 in decimal.

Why it matters

• CPU ALUs implement integer ops in binary hardware
• Masks, flags, and permissions are bit-level ideas
• Networking and file formats expose hex dumps of binary layouts
• CS courses use binary math to build intuition for two’s complement and overflow

You can always convert to decimal, compute, and convert back — a calculator that stays in binary (and shows other bases) is faster for learning carries and bit patterns. Open the binary calculator and add small values like 1010 + 0011 while watching decimal side results for a sanity check.

Other numeral systems for humans, such as Roman numerals, use different rules entirely — compare with the Roman numeral converter and Roman numeral guide when you leave positional binary/decimal systems.

Add column by column from the right, same as decimal, with these bit rules:

• 0 + 0 = 0
• 0 + 1 = 1
• 1 + 1 = 0 carry 1
• 1 + 1 + carry 1 = 1 carry 1

Worked example

0101 (5) + 0011 (3): rightmost 1+1 → write 0 carry 1; next 0+1+carry1 → write 0 carry 1; next 1+0+carry1 → write 0 carry 1; next 0+0+carry1 → write 1. Result 1000 (8). Carries are the whole game — students who skip them invent “binary that does not match the calculator.”

Word width

Hardware adds within a fixed width (8, 16, 32, 64 bits). A carry out of the top bit is overflow for unsigned addition (or a flag the CPU records). On paper with unlimited bits, you simply grow the result. In code, know your type width.

Run the same operands in the free binary addition calculator and compare multi-base outputs (binary, decimal, hex, octal) so you connect bit patterns to everyday numbers.

Two common teaching approaches: direct borrow (like decimal subtraction) and two’s complement addition (how hardware usually subtracts).

Borrow method

Column by column: 0 − 1 needs a borrow from a higher 1, flipping intermediate zeros. Example sketches appear in every textbook; practice until borrows feel mechanical.

Two’s complement method

To compute A − B in fixed width: invert B’s bits, add 1 (that is −B in two’s complement), then add to A and keep the width. Overflow rules differ for signed interpretation. This is why “subtract” and “add negative” are the same circuit.

• Unsigned — values from 0 to 2ⁿ−1; underflow wraps or flags depending on context
• Signed two’s complement — high bit is sign; range roughly −2ⁿ⁻¹ through 2ⁿ⁻¹−1

Use the binary calculator to subtract and inspect whether your mental model assumes infinite width or a fixed bit count. When overflow detection is shown, treat it as a lesson in width, not a mystery error.

If you need pure base conversion without arithmetic, a binary decimal hex converter isolates that step.

Multiplication in binary is shift-and-add. Because digits are only 0 or 1, partial products are either zero or a shifted copy of the multiplicand. That is simpler than decimal multiplication tables — the hard part is aligning shifts and summing partials without losing carries.

Multiplication sketch

Multiply by 2 is a left shift. Multiply by 5 (101) is “add the value, plus the value shifted by 2.” Hardware uses arrays of adders or iterative shift-add; software big-integer libraries generalize the same idea.

Division

Long division in binary compares, subtracts or not, and shifts — again only bits 0 and 1 in the quotient. Integer division truncates toward zero or toward −∞ depending on language; always know which. Division by zero is undefined; calculators should error clearly.

• Multiply — partial products + shifts
• Divide — repeated subtract/shift; watch remainder
• Modulo — remainder after integer division; bit tricks exist for powers of two

Exercise both operations in the binary calculator with small operands first, then larger strings. Cross-check decimal results so a single missed shift cannot hide.

Percentage and ratio problems are base-10 application math — use a percentage calculator and the percentage guide when the question is “what percent,” not “what bit pattern.”

A bit is one binary digit. A group of 8 bits is a byte (common addressing unit). Patterns of n bits represent 2ⁿ distinct values. Overflow happens when a true mathematical result cannot fit the representation you chose — for example, unsigned 8-bit 255 + 1 becomes 0 if it wraps.

Reading multi-base output

• Binary — exact bit pattern you computed
• Decimal — human-friendly magnitude check
• Hexadecimal — compact view of bits (one hex digit = 4 bits)
• Octal — less common today; one octal digit = 3 bits

Hex dumps in debuggers are not a different number universe; they are binary grouped by nibbles. Web colors use hex for RGB channels — related notation, different purpose — see how to convert hex colors when you mean #RRGGBB rather than machine words.

The binary calculator showing all bases at once trains that translation muscle. For identifiers that are not small integers, random 128-bit UUIDs live in another tool: the UUID generator and UUID guide.

Rote conversion tables fade; active calculation sticks. A useful practice sequence:

1. Convert small decimals to binary by repeated divide-by-2.
2. Add and subtract without a calculator; then verify.
3. Multiply by powers of two using shifts.
4. Interpret the same bit pattern as unsigned and as two’s complement signed.
5. Predict overflow for a given width, then test.
6. Read hex dumps and rewrite them as binary groups of four bits.

Connect to real code

Language integers are finite. Bitwise &, |, ^, ~, and shifts are binary operations on those bits. Understanding arithmetic carries helps you debug off-by-one flags and packing structs. Encoding bytes as text (Base64) is a different layer on top of binary payloads — see how Base64 encoding works when bits must travel through text systems.

Drill with the free binary calculator, then re-solve the same problems on paper. The tool checks you; paper builds speed for exams and interviews.

Enter operands in binary, choose an operation, and read step-oriented results plus multi-base views.

1. Open the free binary calculator.
2. Enter the first binary operand (only 0 and 1).
3. Enter the second operand the same way.
4. Choose add, subtract, multiply, or divide.
5. Review the binary result and the decimal/hex/octal equivalents.
6. Note overflow or width warnings when the tool provides them.
7. Change one bit and recompute to build intuition for place value.
8. Recreate the same problem on paper for study retention.

Related tools: binary decimal hex converter for pure conversion, Roman numeral converter for non-positional numerals, percentage calculator for ratio arithmetic, and UUID generator for large random identifiers.