Convert numbers between Binary, Octal, Decimal, Hexadecimal, and 30+ number systems
Professional base converter calculator supporting 15+ number systems. Convert between Binary, Octal, Decimal, Hexadecimal instantly. Includes bitwise operations, signed/unsigned support, and educational features. Perfect for programmers and students.
Binary (base-2) uses only digits 0 and 1, representing on/off electrical states in computer hardware and is the fundamental language computers understand at the transistor level. Octal (base-8) uses digits 0-7 and was historically popular for representing binary data in groups of 3 bits, commonly seen in Unix file permissions and early computing. Decimal (base-10) uses digits 0-9 and is the standard number system humans use in everyday mathematics and counting because we have ten fingers. Hexadecimal (base-16) uses digits 0-9 and letters A-F, allowing compact representation of binary data in groups of 4 bits, widely used for memory addresses, colors (#RRGGBB), and debugging because two hex digits represent exactly one byte.
To convert from any base to decimal, multiply each digit by the base raised to its position power (counting from right, starting at position 0) and sum all the results. For example, binary 1011 equals (1×2³) + (0×2²) + (1×2¹) + (1×2⁰) = 8+0+2+1 = 11 in decimal. To convert from decimal to another base, repeatedly divide the decimal number by the target base and collect the remainders in reverse order. For example, decimal 11 to binary: 11÷2=5 remainder 1, 5÷2=2 remainder 1, 2÷2=1 remainder 0, 1÷2=0 remainder 1, reading remainders backwards gives 1011. Our calculator automates this process instantly showing results for all bases simultaneously.
Unsigned numbers represent only zero and positive values, using all available bits for magnitude. For example, an 8-bit unsigned number can represent values from 0 to 255 using all combinations of 8 bits. Signed numbers can represent both positive and negative values using two's complement notation, where the highest bit indicates the sign (0 for positive, 1 for negative). An 8-bit signed number ranges from -128 to +127 because one bit is reserved for the sign. Use unsigned for counts, sizes, array indices, and values that are always positive. Use signed for differences, coordinates, temperatures, and values that can be negative. Most programming languages default to signed integers but provide unsigned types when needed.
Two's complement is the standard method computers use for representing negative numbers because it simplifies arithmetic operations allowing the same circuitry for addition and subtraction. To convert a positive number to its negative two's complement representation: first invert all bits (change each 0 to 1 and each 1 to 0) then add 1 to the result. For example, to represent -5 in 8-bit signed: start with +5 which is 00000101 in binary, invert all bits to get 11111010, add 1 to get final result 11111011 which represents -5. The highest bit being 1 indicates it's a negative number. To convert back from two's complement to positive, use the same process: invert all bits and add 1, making the algorithm symmetric and efficient.
Bitwise operations work directly on individual bits of binary numbers and are fundamental in low-level programming, optimization, embedded systems, and hardware control. AND operation returns 1 only if both corresponding bits are 1, useful for masking and extracting specific bits from registers or flags. OR operation returns 1 if either bit is 1, used for setting bits or combining flags. XOR operation returns 1 if bits differ, used in encryption, parity checking, and toggling bits. NOT operation inverts all bits. Shift operations move bits left or right, equivalent to multiplying or dividing by powers of 2 but much faster. These operations are extremely fast taking single CPU cycles and are essential for network programming, graphics, cryptography, compression, and embedded systems development where performance and memory are critical.
Hexadecimal is ubiquitous in web development and programming. Primary uses include CSS color codes where #RRGGBB represents red, green, and blue color channels in hexadecimal (00-FF per channel), for example #FF5733 equals rgb(255, 87, 51). Unicode character codes use \u followed by 4 hex digits like \u0041 for 'A'. URL encoding uses %XX format where XX is hex. Memory addresses and pointers are displayed in hex by debuggers making binary data compact and readable. CSS unicode escapes, Base64 encoding internals, MAC addresses in networking (00:1A:2B:3C:4D:5E), IPv6 addresses, and file format specifications all use hexadecimal. Each hex digit represents exactly 4 bits making conversion between hex and binary trivial, which is why hex is preferred over decimal for representing raw binary data.
Base-32 encoding uses 32 characters (A-Z and 2-7) following RFC 4648 standard, commonly used in TOTP (time-based one-time password) secrets for two-factor authentication and in Crockford's base32 for human-readable identifiers avoiding ambiguous characters like 0/O and 1/I. Base-64 encoding uses 64 characters (A-Z, a-z, 0-9, +, /) to convert binary data into ASCII text, allowing binary data transmission over text-only channels. Each Base-64 character represents 6 bits, so 3 bytes (24 bits) become 4 Base-64 characters with optional padding. Base-64 is extensively used in data URIs for embedding images in HTML/CSS, email attachments via MIME encoding, JWT tokens for authentication, API keys and secrets, basic HTTP authentication, and storing binary data in JSON or XML. While Base-64 increases size by approximately 33%, it ensures data survives text-based transmission without corruption.
Unix file permissions are traditionally written in octal notation where each octal digit (0-7) represents permissions for owner, group, and others respectively. Each octal digit maps directly to 3 binary bits representing read (value 4), write (value 2), and execute (value 1) permissions which can be added together. For example, chmod 755 means: owner has 7 (binary 111 = 4+2+1 = read+write+execute), group has 5 (binary 101 = 4+0+1 = read+execute), others have 5 (read+execute). So 755 in octal equals 111101101 in binary equals rwxr-xr-x in symbolic notation. Another example: 644 means owner read+write (6=110=rw-), group read-only (4=100=r--), others read-only (4=r--). This compact octal representation is more concise than decimal which is why it's preferred, and understanding the octal-to-binary mapping helps visualize exact permission bits.
The maximum practically useful base is 64, though mathematically any positive integer can serve as a base. Base-36 uses all decimal digits (0-9) plus all uppercase letters (A-Z), making it the maximum case-insensitive alphanumeric base often used for URL shorteners and license keys. Base-62 adds lowercase letters for case-sensitive systems. Base-64 extends further using uppercase, lowercase, digits, plus two special characters (typically + and /), standardized in RFC 4648 for data encoding. Beyond 64, you would need additional symbols which aren't standardized across systems causing compatibility issues. Our calculator supports common bases up to 36 with standard digit sets. Very high bases beyond 36 are rarely used in practice except for specialized encoding schemes because they require special character sets and become difficult for humans to work with manually.
Common programming applications include: converting hexadecimal color codes (#FF5733) to decimal RGB values (255, 87, 51) for color manipulation algorithms, understanding memory addresses displayed in hexadecimal by debuggers and memory dumps, calculating bit masks for flags and permissions using binary and hexadecimal representations, converting between integer formats when interfacing with different APIs or network protocols that may use different bases, debugging binary network protocols by converting packet data bytes to hexadecimal for analysis, understanding byte layouts and structures in binary file formats and data serialization, calculating and verifying subnet masks in networking which are often represented in both decimal dotted notation and hexadecimal, verifying checksums or hash outputs that are typically displayed in hexadecimal format, and understanding low-level bitwise operations used in compression algorithms, encryption, graphics programming, and embedded systems development where bit-level control is essential for performance and functionality.