Computer Math

Binary Arithmetic Calculator

Perform addition, subtraction, multiplication, division, and bitwise logic operations on base-2 numbers.

Preparing Binary Calculator

Please wait ...

Input

Enter your binary values using only 0 and 1 digits, select your arithmetic or logical operation, and calculate the result.

Input summary

Your calculator summary shows here.

Step by Step Calculation

Step by step calculation shows here

Calculate first and the full working will appear below automatically.

A Guide to Base-2 Binary Mathematics

While humans count using a decimal system containing ten digits (0 through 9), computer hardware communicates using a base-2 system containing only two digits: 0 and 1. This system is known as binary. Each digit is called a bit. Understanding binary arithmetic is essential for computer science, hardware engineering, networking, and software programming.

How Binary Arithmetic Works

Binary operations follow rules similar to decimal math, but they carry over and borrow at much smaller values. For example, in binary addition, 0 + 0 is 0, 0 + 1 is 1, and 1 + 1 is 0 with a carry of 1 (representing the value 2 in decimal). This carrying of bits forms the basis of computer processing registers.

Binary systems are closely linked to other digital numbering systems. Programmers often convert binary digits into a shorter code system to make them readable, which you can calculate using our hexadecimal grid code solver. Binary positions represent doubling values, which you can study with our calculating powers of two tool.

Applications for Base-2 Systems

Computer Hardware: Digital circuits use transistors that act as switches, representing ON (1) or OFF (0) states.
IP Networking: Subnet masks and routing paths are determined by matching binary addresses using bitwise logic.
Data Security: Cryptographic systems use bitwise XOR operations to scramble messages for secure online transmission. You can generate random keys with our generating random values tool.
Logic Gate Design: Engineers combine binary states to construct logical gates (AND, OR, NOT) that process instructions, which you can evaluate using our scientific expressions solver.

Bitwise Logic Operations

In addition to standard math like division or multiplication, binary numbers support bitwise logic. An AND operation yields a 1 only when both compared bits are 1. An OR operation yields a 1 if at least one bit is 1. An XOR (exclusive OR) yields a 1 only when the two bits are different.

These bitwise operations are executed directly by computer processors at the hardware level, making them extremely fast. If you are comparing this to standard base-10 math, you can use our standard base ten math tool to see the decimal equivalents of your calculations.

Example of Binary Addition

Suppose we want to add the binary numbers 10 (decimal 2) and 11 (decimal 3) together.

Aligning them: 10 + 11. In the rightmost column, 0 + 1 = 1. In the leftmost column, 1 + 1 = 0 with a carry of 1. Bringing down the carry gives 101. The binary sum is 101. Converting 101 back to decimal reveals 1 × 4 + 0 × 2 + 1 × 1 = 5, which matches our standard math (2 + 3 = 5). This illustrates how base-2 calculations map perfectly to decimal systems.