1011 + 110
Three carries ripple through the columns.
Step by step
- Add column by column from the right. 1 + 1 = 10, so write 0 and carry 1
2⁴ 2³ 2² 2¹ 2⁰ Carry 1 1 1 1 0 1 1 + 1 1 0 Sum 1 0 0 0 1 - Check in decimal10112 + 1102 = 11 + 6 = 1710 = 100012
Free calculator
Binary addition, subtraction and multiplication worked column by column, with every carry and borrow written in.
Binary arithmetic works like decimal arithmetic with only two digits. In addition, 1 + 1 = 10, so you write 0 and carry 1. In subtraction, 0 − 1 means borrowing 2 from the next column. For 1011 + 110 the answer is 10001, which is 11 + 6 = 17 in decimal.
| 2⁴ | 2³ | 2² | 2¹ | 2⁰ | |
|---|---|---|---|---|---|
| Carry | 1 | 1 | 1 | ||
| 1 | 0 | 1 | 1 | ||
| + | 1 | 1 | 0 | ||
| Sum | 1 | 0 | 0 | 0 | 1 |
Work from the right. 0 + 0 = 0, 0 + 1 = 1, and 1 + 1 = 10: write the 0 and carry the 1 to the next column. With a carry coming in, 1 + 1 + 1 = 11: write 1 and carry 1.
In 1011 + 110 the columns give 1, 0, 0, 0 with carries running left, ending in 10001. If the signs feel fiddly at first, that is normal; the carry is the only new idea.
Subtraction uses borrowing, but a borrow is worth 2 rather than 10. In 1000 − 11 you borrow all the way across and get 101. Multiplication is the easy one: multiplying by 0 gives zeros and multiplying by 1 copies the number, shifted left one place per column. Then you add the rows. 101 × 11 is 101 plus 1010, which is 1111.
Convert both inputs, do the sum, and convert back. 1000 − 11 is 8 − 3 = 5, and 5 is 101. If you need the conversions themselves, the decimal to binary guide and binary to decimal guide show them step by step.
Worked examples
Each one is computed by the calculator above, so the answers are the real output.
Three carries ripple through the columns.
| 2⁴ | 2³ | 2² | 2¹ | 2⁰ | |
|---|---|---|---|---|---|
| Carry | 1 | 1 | 1 | ||
| 1 | 0 | 1 | 1 | ||
| + | 1 | 1 | 0 | ||
| Sum | 1 | 0 | 0 | 0 | 1 |
The 1 on the left has to be borrowed across three columns.
| 2³ | 2² | 2¹ | 2⁰ | |
|---|---|---|---|---|
| Borrow | −1 | −1 | −1 | |
| 1 | 0 | 0 | 0 | |
| − | 1 | 1 | ||
| Difference | 1 | 0 | 1 |
Two shifted copies of 101, added.
| 2⁴ | 2³ | 2² | 2¹ | 2⁰ | |
|---|---|---|---|---|---|
| 1 | 0 | 1 | |||
| × | 1 | 1 | |||
| 1 | 0 | 1 | |||
| + | 1 | 0 | 1 | 0 | |
| Product | 1 | 1 | 1 | 1 |
The second number is larger, so the answer is negative.
| 2² | 2¹ | 2⁰ | |
|---|---|---|---|
| Borrow | −1 | ||
| 1 | 0 | 1 | |
| − | 1 | 1 | |
| Difference | 1 | 0 |
FAQ
10, which is two. You write 0 and carry 1.
Column by column from the right. When you need 0 − 1, borrow from the next column to the left, which adds 2 to the current one.
Like long multiplication: one shifted copy of the first number for every 1 in the second, then add the copies.
Up to 32 bits per number.