Adding binary: 1011 + 1101
1011₂ = 11, 1101₂ = 13. Sum: 11 + 13 = 24 = 11000₂. Verify by column addition with carries: 1011 + 1101 = 11000. Used in CPU adder circuits.
Add, subtract, multiply or divide binary numbers - and instantly see the result in binary, decimal, octal and hex. Built on BigInt so you can compute large binary values without precision loss.
Digits 0 and 1 only
Digits 0 and 1 only
A in decimal
11
B in decimal
6
Result (binary)
10001
Decimal
17
Octal
21
Hex
11
Type a binary number above and read its decimal, hex and octal in the result row. To go decimal → binary, enter a decimal in our Scientific Calculator then convert.
128 in binary: 10000000 · 255 in binary: 11111111
Binary (base-2) is the native language of computers - every byte of storage, every signal in a CPU, every bit transmitted over the internet is ultimately a sequence of 0s and 1s. Understanding binary is essential for computer science students, JEE Advanced aspirants (numerical methods section), embedded systems engineers, networking professionals, and anyone learning bit-level programming. This calculator handles addition, subtraction, multiplication, division and modulo on binary numbers of any length, using BigInt internally so precision is never lost regardless of magnitude.
Beyond pure binary arithmetic, the calculator simultaneously shows the result in decimal (base 10, our everyday system), octal (base 8, legacy Unix file permissions), and hexadecimal (base 16, used everywhere in programming for memory addresses, colour codes, MAC addresses). One hex digit equals exactly 4 binary bits - that's why hex is the preferred compact notation for byte-level work. Indian engineering curricula (B.Tech CSE, ECE, IT) include binary arithmetic in digital electronics, computer organisation, and operating systems courses; this calculator helps verify homework and understand cross-base relationships.
Enter two binary numbers (digits 0 and 1 only).
Pick an operation: +, −, ×, ÷, mod.
See the result in all four bases.
Binary inputs are parsed digit by digit and converted to BigInt for arithmetic. Negative numbers use a leading minus sign. Result is displayed back in binary, decimal, octal and hex for cross-reference.
Binary uses base 2: each digit represents a power of 2. 101₂ = 1×2² + 0×2¹ + 1×2⁰ = 5
Binary representation: each position represents a power of 2. From right to left: position 0 is worth 1 (2⁰), position 1 is worth 2 (2¹), position 2 is worth 4 (2²), position 3 is worth 8, etc. So 1011₂ = 1×8 + 0×4 + 1×2 + 1×1 = 11 in decimal. Reading binary becomes second nature with practice.
Arithmetic in binary works just like decimal but with only two digits. Addition: 0+0=0, 0+1=1, 1+1=10 (write 0, carry 1). Subtraction uses borrowing. Multiplication is shift-and-add (multiplying by 2 just shifts left). Division by 2 shifts right. This shift-based arithmetic is much faster on hardware than decimal arithmetic - which is why computers use binary internally even though we display results in decimal.
Base conversions: 1 hex digit = exactly 4 binary bits (16 = 2⁴). So 11010110₂ = D6₁₆. 1 octal digit = exactly 3 binary bits (8 = 2³). So 11010110₂ groups as 11.010.110 = 326₈. These exact mappings make hex and octal natural 'compression' notations for binary - a 32-bit machine register reads as 8 hex digits, much easier than 32 bits. Decimal doesn't map cleanly to any power of 2, which is why programmers prefer hex over decimal for byte-level work.
1011₂ = 11, 1101₂ = 13. Sum: 11 + 13 = 24 = 11000₂. Verify by column addition with carries: 1011 + 1101 = 11000. Used in CPU adder circuits.
255₁₀ = 11111111₂ = FF₁₆ = 377₈. This is the maximum value of an unsigned 8-bit byte. Useful for understanding why colour values 0-255 are used in RGB (8 bits per channel).
Each 255 = 11111111. Each 0 = 00000000. Full mask: 11111111.11111111.11111111.00000000. The leading 1s define the network portion; the trailing 0s the host portion. This is a /24 CIDR mask.
Transistors have two stable states (off/on) which map naturally to 0/1. All computer storage and logic uses binary at the lowest level.
Repeatedly divide by 2 and read remainders bottom-up. Or use this calculator - type a decimal and read the binary output.
Methods for representing negative binary numbers. 2's complement is the modern standard - flip all bits then add 1. This calculator uses signed decimal style with explicit minus.
Historical convention - early IBM computers used 8-bit chunks for character encoding, and the standard stuck. 1 byte = 8 bits = values 0-255 unsigned.
BigInt has no fixed limit. You can compute thousands of digits with no precision loss, though display becomes impractical past a few hundred bits.
One hex digit = exactly 4 binary bits. That's why programmers use hex - it's a compact notation that maps cleanly to binary.
From simple percentages to scientific notation, statistics, geometry and big-number arithmetic - every common math problem you'd reach for a calculator for, runs in your browser with no installs. The fraction calculator preserves exact rationals, the big-number calculator uses BigInt for hundreds of digits without precision loss, and the scientific calculator's expression evaluator is a hand-written shunting-yard parser (no eval) that supports trig, log, factorial and parentheses.
If you're a student, double-check your work without paying for a graphing calculator. If you're a professional, use these tools as a sanity check on spreadsheet formulas. Every result is shown alongside its formula and inputs, so the math is always auditable.
The Binary Calculator is part of the Math suite on Online Calculator Tools, alongside 6 related calculators. All tools share the same UI patterns, the same privacy-first rendering (nothing is sent to a server), and the same commitment to showing the formula and assumptions behind every result.