Last updated: March 2026
What Is the Binary Calculator?
The binary calculator is a free tool that performs arithmetic, base conversion, and bitwise operations on binary numbers. It shows step-by-step work for every calculation, making it useful for computer science courses, programming, and understanding how computers process data at the lowest level.
Binary (base-2) is the language of computers. Every number, character, and instruction a computer processes is ultimately represented as a sequence of 0s and 1s. Understanding binary arithmetic and bitwise operations is fundamental to fields like systems programming, networking, embedded development, and digital electronics.
How to Use This Binary Calculator
Arithmetic Mode: Enter two binary numbers and choose an operation (add, subtract, multiply, or divide). The result appears instantly in binary with decimal, octal, and hexadecimal equivalents. Expand the step-by-step section to see carries, partial products, or long division work.
Converter Mode: Type a number in any base (binary, decimal, octal, or hexadecimal) and see it converted to all four formats simultaneously. Use the quick presets for common values like 255, 1024, or 65535. Step-by-step explanations show positional values and grouping methods.
Bitwise Mode: Enter binary values and apply logical operations (AND, OR, XOR, NOT) or bit shifts. The visual bit display color-codes each bit position, making it easy to see how operations affect individual bits.
Bit Width: Toggle between 8-bit, 16-bit, and 32-bit modes. Enable the signed toggle to interpret results as two's complement signed integers.
Key Features
Full binary arithmetic. Add, subtract, multiply, and divide binary numbers. Subtraction uses two's complement, multiplication shows partial products, and division shows long-division steps. Every operation includes the complete working process.
Multi-base conversion. Convert between binary, decimal, octal, and hexadecimal instantly. The converter shows how positional notation works, how to group bits for hex (4-bit nibbles) and octal (3-bit groups), and the repeated-division method for decimal-to-binary conversion.
Bitwise operations with visualization. Perform AND, OR, XOR, NOT, left shift, and right shift. Each bit is displayed as a colored box with its positional value, so you can see exactly which bits change during an operation.
Export results. Download your calculation as a CSV file or copy the full result with steps as JSON for use in documentation, homework, or development workflows.
Binary Number System Explained
The binary number system uses only two digits: 0 and 1. Each position represents a power of 2, just as each position in decimal represents a power of 10. The rightmost bit (least significant bit) is 2⁰ = 1, the next is 2¹ = 2, then 2² = 4, 2³ = 8, and so on. For example, binary 1101 = 8 + 4 + 0 + 1 = 13 in decimal.
Computers use binary because digital circuits have two states: on (1) and off (0). This simplicity makes hardware reliable and fast. A single binary digit is called a bit. Eight bits form a byte, which can represent 256 different values (0 to 255). Modern processors work with 32-bit or 64-bit numbers, enabling values up to 4 billion or 18 quintillion respectively.
Frequently Asked Questions
How do you add binary numbers?
Binary addition follows the same column-by-column process as decimal addition but with only two digits: 0 and 1. The rules are: 0+0=0, 0+1=1, 1+0=1, and 1+1=10 (0 with a carry of 1). When two 1s and a carry produce 1+1+1=11 (1 with a carry of 1). Work right to left, carrying as needed.
How do you convert binary to decimal?
Multiply each binary digit by its positional value (powers of 2) and sum the results. For example, 1011 = (1×2³) + (0×2²) + (1×2¹) + (1×2⁰) = 8 + 0 + 2 + 1 = 11. The rightmost bit is 2⁰ (1), next is 2¹ (2), then 2² (4), and so on.
What are bitwise operations used for?
Bitwise operations manipulate individual bits and are used in low-level programming, networking (subnet masks), graphics (color manipulation), cryptography, and performance optimization. AND is used for masking bits, OR for setting bits, XOR for toggling bits and checksums, and shifts for fast multiply/divide by powers of 2.
What is two's complement?
Two's complement is the standard way computers represent signed (positive and negative) integers. To find the two's complement of a number: invert all bits (0→1, 1→0) and add 1. In 8-bit two's complement, values range from -128 to 127. The most significant bit indicates the sign: 0 for positive, 1 for negative.
What is the maximum value for 8, 16, and 32-bit numbers?
For unsigned integers: 8-bit max is 255 (11111111), 16-bit max is 65,535, and 32-bit max is 4,294,967,295. For signed two's complement: 8-bit range is -128 to 127, 16-bit is -32,768 to 32,767, and 32-bit is -2,147,483,648 to 2,147,483,647.
Related Tools
Scientific Calculator
Full scientific calculator with trig, logs, graphing, and history
Percentage Calculator
Calculate percentages, percent change, markup, and discounts
Hex Color Converter
Convert between HEX, RGB, HSL, and other color formats
Statistics Calculator
Calculate mean, median, mode, standard deviation, and more