Binary Calculator

The Binary Number System: How Computers Count

The binary number system (base-2) uses only two digits — 0 and 1 — called bits (binary digits). Every computer, smartphone, and digital device internally stores and processes all information in binary, because electrical circuits can reliably represent two distinct states: high voltage (1) and low voltage (0).

Each position in a binary number represents a power of 2, increasing from right to left:

Binary to decimal conversion: Multiply each bit by its place value and sum all results.

Example: 10110101₂ = 1×128 + 0×64 + 1×32 + 1×16 + 0×8 + 1×4 + 0×2 + 1×1 = 128 + 32 + 16 + 4 + 1 = 181

Decimal to binary conversion: Repeatedly divide by 2, recording the remainder at each step, then read remainders from bottom to top.

Example: Convert 181 to binary:

• 181 ÷ 2 = 90 remainder 1
• 90 ÷ 2 = 45 remainder 0
• 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

Read remainders bottom to top: 10110101₂ ✓

Binary Arithmetic: Addition, Subtraction, and Multiplication

Binary arithmetic follows the same rules as decimal, but carries happen at 2 instead of 10.

Binary addition rules: 0+0=0, 0+1=1, 1+0=1, 1+1=10 (carry 1), 1+1+1=11 (carry 1)

Example: 1011₂ + 1101₂ (11 + 13 = 24)

  1011
+ 1101
------
 11000

Working right to left: 1+1=10 (write 0, carry 1); 1+0+1=10 (write 0, carry 1); 0+1+1=10 (write 0, carry 1); 1+1+1=11 (write 1, carry 1); final carry writes 1. Result: 11000₂ = 24 ✓

Two's complement (binary subtraction): Computers handle negative numbers and subtraction using two's complement representation. To find the two's complement of a number: flip all bits, then add 1.

Example: −13 in 8-bit two's complement: +13 = 00001101₂ → flip all bits → 11110010₂ → add 1 → 11110011₂

This allows subtraction to be performed as addition: 20 − 13 = 20 + (−13).

Binary multiplication is elegant: each partial product is either 0 (multiplying by 0) or the number itself (multiplying by 1), shifted left. Example: 1011₂ × 101₂ (11 × 5 = 55):

    1011
  ×  101
  -----
    1011    (1011 × 1)
   0000     (1011 × 0, shifted)
  1011      (1011 × 1, shifted twice)
  -------
  110111₂ = 55 ✓

Binary in Computing: Bits, Bytes, and Data Sizes

Understanding binary units is essential for anyone working with computers, storage, or network speeds:

Color values: Web colors use 24-bit RGB (8 bits per channel). #FF5733 = R:255, G:87, B:51. Each 8-bit channel can represent 256 shades (0–255). Total possible colors: 256³ = 16,777,216 (about 16.7 million).

File permissions in Unix/Linux: rwxr-xr-- = 111 101 100 in binary = 7, 5, 4 in octal = chmod 754. Each set of 3 bits represents read (r=4), write (w=2), and execute (x=1) permissions for owner, group, and others.

Bitwise Operations and Their Applications

Bitwise operations manipulate individual bits within integers. They are fundamental to low-level programming, cryptography, network programming, and performance-critical code.

Practical uses:

• Bit masking: Check if a specific bit is set: if (flags & 0b0100) { ... } — checks if bit 2 is 1.
• Setting a bit: flags = flags | 0b0100 — sets bit 2 to 1 regardless of current value.
• Clearing a bit: flags = flags & ~0b0100 — clears bit 2 to 0.
• Fast multiplication/division by powers of 2: n << 3 = n × 8; n >> 2 = n ÷ 4. Bit shifts are CPU-level operations, significantly faster than multiplication.
• Checking even/odd: if (n & 1) { /* odd */ } — the last bit of any odd number is always 1.

Number Systems Comparison: Binary, Octal, Decimal, Hexadecimal

Computer science uses four number systems, each suited to different contexts:

Quick conversion: binary ↔ hex (4 binary digits = 1 hex digit):

This 4-bit grouping makes hex extremely useful as a compact notation for binary data: the 32-bit value 11001010 00111111 10110101 00001100 is much easier to write as CA3FB50C.

Binary in Networking: IP Addresses and Subnet Masks

Understanding binary is essential for network engineering because IPv4 addresses are fundamentally 32-bit binary numbers, and subnetting — the process of dividing networks — relies entirely on binary operations.

An IPv4 address like 192.168.1.100 is human-readable notation for the 32-bit binary value:

11000000.10101000.00000001.01100100

A subnet mask determines which portion of the address identifies the network and which identifies the host. The mask 255.255.255.0 in binary is:

11111111.11111111.11111111.00000000

The bitwise AND of the IP address and subnet mask gives the network address:

CIDR notation (e.g., /24) tells you how many leading 1-bits are in the subnet mask. A /24 mask has 24 ones followed by 8 zeros, allowing 2⁸ − 2 = 254 usable host addresses per subnet. A /16 mask allows 65,534 hosts. Network engineers use binary mental math daily to plan subnets, calculate broadcast addresses, and troubleshoot routing.

Binary in Cryptography and Security

Modern encryption algorithms operate entirely at the binary level, manipulating individual bits through combinations of XOR, bit shifts, and substitution operations. Understanding binary is the gateway to understanding how digital security works.

XOR encryption (the foundation of modern ciphers): XOR has a unique property — applying it twice with the same key returns the original value: A ⊕ K ⊕ K = A. This makes XOR the basis of stream ciphers and one-time pads.

Example: encrypting the byte 01001101 (letter 'M' in ASCII) with key 10110010:

• Plaintext: 01001101
• Key: 10110010
• XOR (encrypt): 11111111
• XOR again with same key (decrypt): 01001101 = 'M' ✓

Key sizes in modern encryption: AES-128 uses a 128-bit key, meaning there are 2¹²⁸ ≈ 3.4 × 10³⁸ possible keys — more than the number of atoms in the observable universe. AES-256 uses 256-bit keys with 2²⁵⁶ possibilities. Even the fastest supercomputers cannot brute-force these key spaces. Each additional bit doubles the search space, which is why key length matters exponentially in cryptography.

Hash functions like SHA-256 produce a 256-bit (32-byte) binary output from any input. Even a single bit change in the input produces a completely different hash — a property called the "avalanche effect" that makes hashes useful for verifying data integrity, storing passwords, and powering blockchain technology.

Binary and quantum computing: While classical computers use binary bits (0 or 1), quantum computers use qubits that can exist in a superposition of both states simultaneously. A classical 256-bit key has 2²⁵⁶ possible values that must be checked sequentially; a quantum computer running Grover's algorithm could search this space in √(2²⁵⁶) = 2¹²⁸ operations. This is why post-quantum cryptography is being developed — to create binary-based encryption schemes that remain secure even against quantum adversaries.