Last verified · v1.0

Calculator · math

Binary Addition Calculator

Add two binary numbers and instantly see the result in binary or decimal format. Enter any 0s and 1s for fast, accurate binary addition.

FreeInstantNo signupOpen source

Inputs

First Binary Number

Second Binary Number

Output Format

Sum

—

Get a plain-English breakdown of your result with practical next steps.

Sum—

The formula

How the
result is
computed.

How Binary Addition Works

Binary addition is a fundamental operation in digital computing that follows the same positional rules as decimal addition, but operates exclusively in base 2, using only the digits 0 and 1. Every modern processor performs billions of binary additions per second, making this operation the foundation of all arithmetic in computers, smartphones, and embedded systems. Mastering binary addition unlocks a deeper understanding of how CPUs, memory addressing, and network protocols function at the hardware level.

The Positional Weight Formula

To compute the sum of two binary numbers, each number is first converted to its decimal equivalent using the positional weight formula. For binary operands a (with n bits) and b (with m bits), where each bit a_i or b_j is either 0 or 1, the combined decimal sum is expressed as:

S = ∑_i=0^n-1 a_i · 2ⁱ + ∑_j=0^m-1 b_j · 2^j

Each bit is multiplied by 2 raised to the power of its position index, counting from 0 at the rightmost (least significant) bit. According to Python Numerical Methods at UC Berkeley, this positional notation is the same principle governing all base-N number systems, including the familiar base-10 decimal system used in everyday arithmetic.

Step-by-Step Worked Example

Consider adding the binary numbers 1011 and 0110:

Convert 1011 to decimal: 1·2³ + 0·2² + 1·2¹ + 1·2⁰ = 8 + 0 + 2 + 1 = 11
Convert 0110 to decimal: 0·2³ + 1·2² + 1·2¹ + 0·2⁰ = 0 + 4 + 2 + 0 = 6
Add the decimal values: 11 + 6 = 17
Convert 17 back to binary: 17 = 16 + 1 = 1·2⁴ + 0·2³ + 0·2² + 0·2¹ + 1·2⁰ = 10001

The final result is 10001 in binary, which equals 17 in decimal. The extra leading bit demonstrates how binary sums frequently require more bits than either operand.

Direct Bitwise Addition Rules

Binary addition can also be performed column by column from right to left using four fundamental carry-propagation rules, as documented in East Tennessee State University's Digital Electronics course notes:

0 + 0 = 0, carry 0
0 + 1 = 1, carry 0
1 + 0 = 1, carry 0
1 + 1 = 0, carry 1 (carry bit propagates left to the next column)

When three bits sum in one column — two operand bits plus an incoming carry — the result ranges from 0 to 3. For instance, 1 + 1 + 1 = 11 in binary (decimal 3), yielding a sum bit of 1 and a carry-out of 1 passed to the next column.

Input Variables Explained

First Binary Number (binary_a): The first operand — enter only digits 0 and 1. For example, 1010 represents decimal 10 because 1·8 + 0·4 + 1·2 + 0·1 = 10.
Second Binary Number (binary_b): The second operand — enter only 0s and 1s. For example, 0101 represents decimal 5 because 0·8 + 1·4 + 0·2 + 1·1 = 5.
Output Format: Choose Binary to display the result as a binary number (e.g., 1111) or Decimal to display the integer equivalent (e.g., 15).

Real-World Applications

Binary addition appears across virtually every domain of computing and digital engineering:

CPU Arithmetic Logic Units (ALUs): Every processor contains full-adder circuits that perform binary addition at the gate level, processing billions of operations per second across 64-bit data paths.
Network Subnetting: Calculating IPv4 and IPv6 host address ranges requires binary addition and bitwise AND operations on 32-bit and 128-bit address fields respectively.
Error Detection and Checksums: Protocols such as TCP/IP compute one's complement sums over binary-encoded data segments to verify transmission integrity across networks.
Digital Signal Processing: Audio, video, and sensor data are represented as binary-encoded samples, and filters combine these samples using millions of addition operations per second.

Overflow and Bit-Width Considerations

Adding two n-bit numbers may produce an (n+1)-bit result. For example, 4-bit 1111 (decimal 15) plus 4-bit 0001 (decimal 1) produces 5-bit 10000 (decimal 16). In fixed-width registers — 8-bit, 16-bit, 32-bit, or 64-bit — the carry-out bit is discarded, causing the result to wrap around and triggering an overflow condition. Correct software and hardware design must detect and handle such cases using overflow flags or wider integer types.

Reference

Frequently asked questions

What is binary addition and how does it work?

Binary addition is the process of adding two numbers expressed in base-2 notation, using only the digits 0 and 1. It follows positional rules identical to decimal addition but operates in base 2. Each bit represents a power of 2, and when two 1s are added, the result is 0 with a carry of 1 propagated to the next column. For example, 1 + 1 = 10 in binary, which equals decimal 2, because the sum exceeds the maximum single-digit value of 1.

How do I add binary numbers manually step by step?

Align both binary numbers at the rightmost digit, then add column by column from right to left. Apply four rules: 0+0=0, 0+1=1, 1+0=1, and 1+1=0 carry 1. Propagate each carry into the next left column. For 1011 plus 0110, the rightmost column gives 1+0=1, the next gives 1+1=0 carry 1, then 0+1+1=0 carry 1, then 1+0+1=0 carry 1, and the final carry gives 1, producing the 5-bit result 10001, which equals decimal 17.

What is 1010 + 0101 in binary?

Adding 1010 (decimal 10) and 0101 (decimal 5) in binary gives 1111, which equals decimal 15. Working column by column from right: 0+1=1, 1+0=1, 0+1=1, and 1+0=1, producing the 4-bit result 1111 with no carries. This can be verified by decimal conversion: 10 plus 5 equals 15, and decimal 15 equals 1x8 + 1x4 + 1x2 + 1x1 = binary 1111. This example is a convenient case because the two numbers are bitwise complements and no carries occur.

Can binary addition produce an overflow?

Yes. Binary overflow occurs when the sum of two n-bit numbers requires more than n bits to represent the result. For example, adding 4-bit values 1111 (decimal 15) and 0001 (decimal 1) produces 10000 (decimal 16), a 5-bit result. In a fixed-width 4-bit register, the carry-out bit is discarded and the stored value wraps around to 0000 (decimal 0). Programmers prevent this by using wider integer data types, such as 32-bit instead of 8-bit, or by explicitly checking processor overflow and carry flags.

What is the difference between binary addition and decimal addition?

Both binary and decimal addition follow the same positional column-by-column algorithm, but they differ in their base. Decimal (base 10) generates a carry only when a column sum reaches 10 or more, while binary (base 2) generates a carry whenever a column sum reaches just 2. This means carries arise far more frequently in binary arithmetic, producing more intermediate carry propagation steps. Despite this, each individual digit sum in binary is simpler, involving only the four combinations of 0 and 1.

Why is binary addition important in computer science?

Binary addition is the core operation performed by every CPU at the hardware level. Arithmetic logic units (ALUs) are built from binary full-adder circuits that execute addition billions of times per second. Understanding binary addition is essential for debugging integer overflow bugs, implementing bitwise manipulation algorithms, working with memory addressing, analyzing hash table and checksum computations, and understanding how the IEEE 754 standard handles floating-point mantissa arithmetic in every modern programming language, from Python and Java to C and Rust.