Binary Addition Calculator

Add two binary numbers with carry bits, step-by-step column addition, and decimal equivalents.

Enter Binary Numbers

Result

Binary Sum (A + B)
11000
binary
A (decimal)11
B (decimal)13
Sum (decimal)24
Number of bits in result5

Step-by-Step Solution

1011 + 1101 = 11000

Understanding Binary Addition

Binary addition is one of the fundamental arithmetic operations in the binary (base-2) number system. Computers use binary addition as the foundation for all arithmetic, making it essential in digital electronics, computer science, and programming. Just like decimal addition, binary addition works column by column from right to left, but with only two digits: 0 and 1.

Binary Addition Rules

Binary addition follows four simple rules that govern how individual bits are added together:

0 + 0 = 0

Adding two zeros gives zero with no carry.

Sum = 0, Carry = 0

0 + 1 = 1

Adding zero and one gives one with no carry.

Sum = 1, Carry = 0

1 + 0 = 1

Adding one and zero gives one with no carry.

Sum = 1, Carry = 0

1 + 1 = 10

Adding two ones gives zero with a carry of 1 (just like 5+5=10 in decimal).

Sum = 0, Carry = 1

How Binary Addition Works

Binary addition proceeds column by column from the rightmost bit (least significant bit) to the leftmost bit (most significant bit). At each position, you add the two bits plus any carry from the previous column. If the sum is 2 or 3, a carry is propagated to the next column.

The Carry Mechanism

When three bits need to be added (two operand bits plus a carry), the possible outcomes are:

  • 0 + 0 + 0 = 0 with carry 0
  • 0 + 0 + 1 = 1 with carry 0 (or 1 + 0 + 0 or 0 + 1 + 0)
  • 1 + 1 + 0 = 10 with carry 1 (or 1 + 0 + 1 or 0 + 1 + 1) -- sum bit is 0
  • 1 + 1 + 1 = 11 with carry 1 -- sum bit is 1

Practical Applications

Binary addition is used in virtually every computing operation. When you add two numbers in any programming language, the CPU performs binary addition at the hardware level using logic gates called adders. Full adders and half adders are the fundamental building blocks of arithmetic logic units (ALUs) in processors.

Overflow in Binary Addition

When adding two n-bit numbers, the result may require n+1 bits. This is called overflow. For example, adding two 4-bit numbers (1111 + 0001 = 10000) produces a 5-bit result. In fixed-width registers, this overflow bit may be lost, leading to incorrect results unless properly handled.

Relation to Other Binary Operations

Binary addition is closely related to other binary operations. Subtraction can be performed using addition with two's complement, multiplication is repeated addition with shifting, and binary addition is the building block for more complex operations like division and floating-point arithmetic.

Tips for Manual Binary Addition

  • Always align the numbers by their rightmost bit before adding.
  • Pad the shorter number with leading zeros to match lengths.
  • Work from right to left, just like decimal addition.
  • Keep track of carry bits carefully -- write them above the next column.
  • Verify your result by converting both operands and the sum to decimal.