Binary Addition Calculator

2
2

Addition Result

—
Step-by-Step Addition

Add binary numbers with clear step-by-step carry visualization. See how each bit-column adds up, when carries occur, and verify your results in decimal, hexadecimal, and octal.

5Number Systems
∞Precision
0msLatency

What is Binary Addition Calculator?

The Binary Addition Calculator is a specialized tool that adds two or more binary numbers together and provides a detailed, step-by-step visualization of the carry process. It shows exactly how each column of bits is summed and when carries propagate to the next position.

This tool exists because binary addition is the most fundamental operation in computing — every CPU at its core is built around adder circuits. Understanding how carries work in binary addition is essential for grasping computer architecture, designing digital circuits, and debugging arithmetic overflow errors in software.

Whether you're learning binary math for a computer science course, verifying hand calculations, or exploring how hardware adder circuits (half adders and full adders) process binary data, this calculator makes the entire addition process transparent and educational.

Interactive Demo

Binary Addition Calculator Formula

Click "Add +1" to watch how carries ripple through the binary counter. When a bit is already 1, adding 1 produces 0 and a carry to the next position.

4-Bit Carry Simulator
2³ 2² 2¹ 2⁰
0
0
0
0
Decimal: 0 ₁₀
Hardware Logic

Inside a Full Adder Gate

A full adder is the core building block of every CPU's arithmetic unit. It takes three 1-bit inputs — A, B, and Carry-in — and produces two outputs: Sum and Carry-out.

The Sum is computed with XOR gates: A ⊕ B ⊕ Cin. The Carry-out uses AND and OR: (A·B) + (Cin·(A⊕B)).

To build a multi-bit adder, you chain full adders together — the carry-out of one feeds into the carry-in of the next. This is called a ripple-carry adder.

Try It Toggle the inputs A, B, and Carry-in to see how the full adder computes Sum and Carry-out.
Full Adder Simulator
A
B
Cᵢₙ
↓ Full Adder ↓
Sum
0
Carry
0
Quick Reference

Worked Addition Examples

1011 + 0110 = 10001
11₁₀ + 6₁₀ = 17₁₀
1100 + 1010 = 10110
12₁₀ + 10₁₀ = 22₁₀
1111 + 0001 = 10000
15₁₀ + 1₁₀ = 16₁₀
More

Other Number System Conversions

Related numeral systems converters for number conversion between binary, decimal, hexadecimal, octal, and ASCII text.

01→10 Binary to Decimal Converter 01.1→10 Binary Fraction to Decimal ±01→10 Signed Binary to Decimal 01→FF Binary to Hexadecimal 01→07 Binary to Octal N→N Binary Base Converter 01+01 Binary Calculator 01−01 Binary Subtraction → 1,2,3 Step-by-Step Solver 0…255 Binary Table Generator 01→A Binary to Text A→01 Text to Binary ±1.M×2ᴱ Floating Point Converter 8b→256 Bit Size Converter & | ^ ~ Bitwise Operations 01→? Binary Decoder
FAQ

Frequently Asked Questions

What are the rules of binary addition?
Binary addition has four rules: 0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, and 1 + 1 = 10 (which means 0 and carry 1 to the next position). When three 1s are added (1 + 1 + carry 1), the result is 11 (1 and carry 1). These are the only rules needed for all binary addition.
How do you add two binary numbers?
Align the binary numbers by their least significant bit (rightmost). Add column by column from right to left, applying the binary addition rules. When a column sums to 2 (10₂), write 0 and carry 1. When it sums to 3 (11₂), write 1 and carry 1. Example: 1101 + 1011 = 11000₂.
What is a carry in binary addition?
A carry in binary addition occurs when the sum of a column exceeds 1 (the maximum single binary digit). Since 1 + 1 = 10₂, the 0 stays in the current position and the 1 carries to the next higher position. This is identical in concept to carrying in decimal addition when a column exceeds 9.
Can binary addition cause overflow?
Yes. In fixed-width binary (e.g., 8-bit), if the result requires more bits than available, overflow occurs. For unsigned 8-bit addition, 11111111 + 00000001 = 100000000 (9 bits), but only 8 bits are stored, so the result wraps to 00000000. This is a common source of bugs in programming.
How is binary addition used in computers?
Binary addition is the most fundamental arithmetic operation in CPUs. Addition circuits (adders) perform all arithmetic: subtraction is done by adding the 2's complement, multiplication is repeated addition with shifting, and comparison is done via subtraction. Every calculation in a computer ultimately relies on binary addition.
What is a half adder and full adder?
A half adder is a logic circuit that adds two single bits, producing a sum and a carry. It uses an XOR gate for the sum and an AND gate for the carry. A full adder adds three bits (two inputs plus a carry-in), producing a sum and carry-out. Full adders are chained together to create multi-bit adders.
Copied to clipboard!