Positional numeral systems—the idea that a digit's value depends on its position within a number—is one of mathematics' most profound inventions. The concept originated in ancient Babylon around 2000 BCE with a base-60 (sexagesimal) system, was refined in India with the base-10 (decimal) system and the revolutionary concept of zero, and eventually spread to the Islamic world and Europe. Every modern number system, from the familiar decimal to the binary that underlies all computing, relies on this same positional principle.

The decimal (base-10) system uses ten symbols (0–9) and each position represents a successive power of ten. We use base-10 almost certainly because humans have ten fingers, but there is nothing mathematically special about ten. Any positive integer greater than one can serve as a base, and computing has settled on several alternatives, each chosen for practical hardware and software reasons.

Binary (base-2) is the most fundamental number system in computing because digital circuits operate on two voltage states: high and low, on and off, 1 and 0. Every number, letter, image, and instruction inside a computer is ultimately represented as a sequence of binary digits (bits). While binary is ideal for circuits, it is cumbersome for humans—the decimal number 255 becomes the eight-digit binary number 11111111. This mismatch between human readability and machine representation is precisely why other bases exist in programming.

Hexadecimal (base-16) uses sixteen symbols (0–9 and A–F) and has a uniquely elegant relationship with binary: each hexadecimal digit maps to exactly four binary bits. This means a single byte (8 bits) is represented by exactly two hex digits, and a 32-bit value by exactly eight hex digits. This clean mapping makes hexadecimal the preferred notation for memory addresses, color codes (#FF5733), MAC addresses (AA:BB:CC:DD:EE:FF), and any context where binary data must be displayed concisely. The 0x prefix convention (e.g., 0xFF) was popularized by the C programming language and is now universally recognized across programming languages.

Octal (base-8) uses eight symbols (0–7), with each digit representing exactly three binary bits. Octal was more prominent in early computing when machines used word sizes that were multiples of three (such as the 12-bit PDP-8 or the 36-bit systems common in the 1960s). Today, octal's primary use is in Unix and Linux file permissions, where the three-bit grouping neatly maps to the three permission types (read=4, write=2, execute=1) for owner, group, and others. The command chmod 755, for instance, sets permissions using octal notation.

The conversion process between bases follows a straightforward algorithm. To convert from any base to decimal, multiply each digit by its positional power and sum the results. To convert from decimal to another base, repeatedly divide by the target base and collect remainders in reverse order. Converting between binary and hexadecimal or octal is even simpler: group the binary digits (four for hex, three for octal) and convert each group independently.