Binary Calculator
Binary is the language of computers: every number is written with just two digits, 0 and 1, and each position is worth twice the one to its right. 1010 means 8 + 2 = 10, and 1100 means 8 + 4 = 12. Binary arithmetic follows the same rules as decimal arithmetic, with carrying and borrowing in base 2 instead of base 10.
Add, subtract, multiply and divide binary numbers — division shows the quotient and the remainder — or convert between binary and decimal. All maths is done with exact BigInt arithmetic, so large numbers stay precise to the last digit, and every result shows its decimal value alongside.
Result
How It Works
Binary addition works like decimal addition, but with only four rules: 0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, and 1 + 1 = 10 (write 0, carry 1). So 1010 + 1100 = 10110: working right to left, 0 + 0 = 0, 1 + 0 = 1, 0 + 1 = 1, and 1 + 1 = 10, giving 10110, which is 22 in decimal — and 10 + 12 = 22, as expected.
Subtraction borrows in twos: 1010 − 11 = 111 (10 − 3 = 7). Multiplication is repeated shifting and adding: 1010 × 11 = 1010 + 10100 = 11110 (10 × 3 = 30). Division gives a quotient and a remainder: 1100 ÷ 10 = 110 remainder 0 (12 ÷ 2 = 6).
To convert binary to decimal, add up the place values of the 1s: 101101 = 32 + 8 + 4 + 1 = 45. To convert decimal to binary, divide by 2 repeatedly and read the remainders backwards: 45 ÷ 2 = 22 remainder 1, 22 ÷ 2 = 11 remainder 0, 11 ÷ 2 = 5 remainder 1, 5 ÷ 2 = 2 remainder 1, 2 ÷ 2 = 1 remainder 0, 1 ÷ 2 = 0 remainder 1 — reading the remainders from the last to the first gives 101101.
Worked Example
Addition: 1010 + 1100 = 10110 (10 + 12 = 22). Multiplication: 1010 × 11 = 11110 (10 × 3 = 30). Subtraction: 1010 − 11 = 111 (10 − 3 = 7). Division: 1100 ÷ 10 = 110 remainder 0 (12 ÷ 2 = 6). Conversion: binary 101101 = 45 in decimal.
Negative results show a minus sign: 11 − 1010 = −111 (3 − 10 = −7). And a division with a remainder: 1011 ÷ 10 = 101 remainder 1 (11 ÷ 2 = 5 remainder 1).
Assumptions
- Inputs are capped at 64 bits. A binary input may have at most 64 significant digits (leading zeros do not count), and a decimal input must be within ±18,446,744,073,709,551,615. Longer inputs are rejected with a message.
- Results are exact. All maths uses BigInt, so results are precise to the last digit — even when a result is longer than 64 bits, as a product of two large numbers can be.
- Division is integer division. The quotient is the whole number of times the divisor fits, and the remainder is what is left over. The check row confirms divisor × quotient + remainder = dividend.
- Negative results use a minus sign (sign-and-magnitude), not two's complement — so 11 − 1010 shows as −111, which is easier to read.
- Only 0 and 1 are binary digits. An input containing 2–9 (or any other character) is rejected, and the error message names the offending digit.
- Division by zero is an error — it is undefined, so the calculator says so rather than showing infinity.
Sources: No external data is used on this page — every figure is calculated from the numbers you enter, using exact BigInt binary arithmetic. Last reviewed: 15 November 2026.
Built and tested by SumKitTool — see how we check our numbers.
How to Use This Calculator
Pick binary arithmetic, enter two binary numbers using only 0 and 1, choose the operation, and the result appears immediately in binary with its decimal value alongside. Division also shows the quotient and the remainder, plus a check row.
Pick convert to switch between binary and decimal: choose the direction, enter the number, and both forms are shown with the number of bits used. Spaces and underscores in binary inputs are ignored, so 1010_1100 works the same as 10101100.
Tips and Practical Advice
Learn the place values and binary becomes easy to read: from the right, the positions are worth 1, 2, 4, 8, 16, 32, 64 and so on — each one double the last. 101101 is 32 + 8 + 4 + 1 = 45, because the 1s sit in the 32, 8, 4 and 1 places.
Multiplying by 2 in binary is just adding a 0 on the right (a left shift): 1010 × 10 = 10100, just as multiplying by 10 in decimal adds a 0. Dividing by 2 drops the last digit — the dropped digit is the remainder.
Binary is how computers store everything, so the 64-bit cap matches the size of a modern processor's registers: a 64-bit unsigned integer holds values up to 18,446,744,073,709,551,615. If you work with colour codes or memory addresses, the hex calculator on this site is the natural next step — every 4 binary digits are exactly one hex digit.
Frequently Asked Questions
How do I add binary numbers?
The same way as decimal addition, but carrying in twos: 0 + 0 = 0, 0 + 1 = 1, and 1 + 1 = 10 (write 0, carry 1). For example, 1010 + 1100 = 10110, which is 10 + 12 = 22 in decimal. Enter both numbers, pick Add, and the calculator shows the binary result and the decimal check.
What is binary 101101 in decimal?
45. Add the place values of the 1s: 101101 has 1s in the 32, 8, 4 and 1 places, so 32 + 8 + 4 + 1 = 45. The converter on this page shows both forms at once, along with how many bits the number uses.
Why is there a 64-bit limit on inputs?
64 bits is the size of a modern processor's registers, and the largest 64-bit value is 18,446,744,073,709,551,615 — far beyond any hand calculation or exam question. The cap keeps inputs manageable; results are still exact and may exceed 64 bits, as when two large numbers are multiplied.
How does binary division work, and what is the remainder?
Division gives a quotient (how many whole times the divisor fits) and a remainder (what is left over). 1100 ÷ 10 = 110 remainder 0, because 12 ÷ 2 = 6 exactly, while 1011 ÷ 10 = 101 remainder 1, because 11 ÷ 2 = 5 remainder 1. The check row confirms divisor × quotient + remainder = dividend.
Last updated: