Numbers Converter
Precise number-system converter for binary, octal, decimal, hexadecimal, and bases 2 through 36 with programmer formatting, step-by-step explanations, and exact whole-number logic.
Last Updated: April 5, 2026
Convert integers across binary, octal, decimal, hexadecimal, and every base from 2 to 36 with deterministic BigInt math, prefix-aware validation, and copy-ready programmer output.
Use the most common number-system workflow: binary, octal, decimal, and hexadecimal.
Quick presets
Tap to loadNumber-system reference
| System | Base | Digit set | Typical use |
|---|---|---|---|
| Binary | Base 2 | Digits 0-1 only | Core computer logic, bits, flags, and low-level data |
| Octal | Base 8 | Digits 0-7 only | Compact grouping of binary in 3-bit chunks |
| Decimal | Base 10 | Digits 0-9 only | Everyday arithmetic and the human default number system |
| Hexadecimal | Base 16 | Digits 0-9 and A-F | Programming, memory addresses, byte dumps, and debugging |
| Base 36 | Base 36 | Digits 0-9 and A-Z | Compact alphanumeric identifiers and generalized base conversion |
Quick conversion examples
| Example | Result | Method |
|---|---|---|
| 1010 base 2 | 10 | Convert the source digits from binary into decimal, then rewrite that same integer in decimal. |
| 25 base 10 | 1 1001 | Convert the source digits from decimal into decimal, then rewrite that same integer in binary. |
| 255 base 10 | FF | Convert the source digits from decimal into decimal, then rewrite that same integer in hexadecimal. |
| A base 16 | 1010 | Convert the source digits from hexadecimal into decimal, then rewrite that same integer in binary. |
| 777 base 8 | 511 | Convert the source digits from octal into decimal, then rewrite that same integer in decimal. |
| Z base 36 | 35 | Convert the source digits from base 36 into decimal, then rewrite that same integer in decimal. |
Important Usage Note
This page is designed for exact integer base conversion. It does not attempt arbitrary-base floating-point or fraction conversion. For signed fixed-width work such as two's-complement interpretation, confirm the intended bit width separately.
Reviewed For Methodology, Labels, And Sources
Every CalculatorWallah calculator is published with visible update labeling, linked source references, and founder-led review of formula clarity on trust-sensitive topics. Use results as planning support, then verify institution-, policy-, or jurisdiction-specific rules where they apply.
Reviewed By
Jitendra Kumar, Founder & Editorial Standards Lead, oversees methodology standards and trust-sensitive publishing decisions.
Review editor profileTopic Ownership
Sales tax and tax-sensitive estimate tools, Education and GPA planning calculators, Health, protein, and screening-formula pages, Platform-wide publishing standards and methodology
See ownership standardsMethodology & Updates
Page updated April 5, 2026. Trust-critical pages are reviewed when official rates or rules change. Evergreen calculator guides are checked on a recurring quarterly or annual cycle depending on topic volatility.
How to Use the Numbers Converter
Enter the whole-number value you want to convert, choose the source base, choose the target base, and the widget updates in real time. That handles common searches like binary to decimal, decimal to binary, decimal to hex, hex to decimal, binary to hex, and hex to binary without forcing you to do the expansion or repeated-division work by hand.
Use Core bases mode when you want the standard programming and math set: binary, octal, decimal, and hexadecimal. Use Programmer mode when prefix handling, grouped binary, hexadecimal letter casing, and bit-length panels matter most. Use Base 2-36 mode when you need a broader numeral-system converter for custom algorithms, identifiers, or classroom exercises. The result card shows the converted value, decimal bridge, digit counts, and method summary, while the tables below show the same integer in several representations.
If you need follow-on arithmetic after converting a value, move into CalculatorWallah's scientific calculator. If you want a broader set of math tools, browse the math calculators. If you arrived looking for a dedicated bitwise calculator, note that the closest live follow-up page today is the scientific calculator for general expression work. If your question moves into bytes, storage sizes, or binary capacity labels, use the data storage converter. For CalculatorWallah's current live programming-adjacent hub, browse the programming tools.
Step 1: Enter the source number
Type the whole-number value you want to convert. You can enter letters for bases above 10, and programmer prefixes such as 0b, 0o, or 0x if you enable auto-detect or choose the matching source base.
Step 2: Choose the source and target bases
Select the numeral system the current value uses and the numeral system you want to see as the result. Core mode focuses on binary, octal, decimal, and hexadecimal, while extended mode opens every base from 2 to 36.
Step 3: Review the converted value and comparison table
The widget shows the target-base result, the decimal bridge value, the core-base comparison table, and optional programmer panels such as 8-bit, 16-bit, and 32-bit views.
Step 4: Use the step-by-step explanation if needed
Open the explanation panel when you want to inspect positional expansion, repeated division, and the validation logic behind the converted result.
How This Numbers Converter Works
This page treats base conversion as a representation problem rather than a value-changing problem. The underlying integer does not change. Only the way that integer is written changes. In other words, 255 in decimal, FF in hexadecimal, 377 in octal, and 11111111 in binary can all describe the same quantity.
The first stage is validation. The converter checks that every digit belongs to the selected source base. In binary, only 0 and 1 are allowed. In octal, only 0 through 7 are allowed. In hexadecimal, 0 through 9 plus A through F are allowed. For higher bases, the page uses A = 10, B = 11, and continues through Z = 35. Lowercase letters are accepted and normalized.
The second stage is the decimal bridge. Each digit is multiplied by the source base raised to the correct positional power, then the terms are added. For example, 1010 in base 2 is 1x2^3 + 0x2^2 + 1x2^1 + 0x2^0, which equals 10 in base 10. This is the same place-value logic students already use in decimal arithmetic, just applied with a different base.
The third stage is rewriting the same integer in the target base. The page uses repeated division for that explanation. Divide the decimal value by the target base, collect the remainders, and read them from last to first. That is why 25 in decimal becomes 11001 in binary: 25 / 2 leaves remainder 1, then 12 / 2 leaves remainder 0, then 6 / 2 leaves 0, then 3 / 2 leaves 1, then 1 / 2 leaves 1. Reading upward gives 11001.
Under the hood, this tool uses exact integer arithmetic with BigInt. That matters because programmers, students, and engineers often test large values, large identifiers, or long binary strings. Floating-point math would be the wrong model for this job. Integer conversion needs deterministic whole-number logic, so this page keeps the value exact and applies grouping, prefixes, and uppercase/lowercase formatting only at display time.
| System | Base | Digits used | Best fit |
|---|---|---|---|
| Binary | Base 2 | 0-1 | Bit logic, flags, machine representation, and low-level computing |
| Octal | Base 8 | 0-7 | Compact binary grouping where one octal digit equals 3 bits |
| Decimal | Base 10 | 0-9 | Everyday counting, arithmetic, and the standard human number system |
| Hexadecimal | Base 16 | 0-9 and A-F | Programming, memory addresses, bytes, color values, and debugging |
| Extended bases | Base 3 to base 36 | 0-9 and A-Z as needed | Custom algorithms, compact IDs, and numeral-system study |
| Example | Method | Result |
|---|---|---|
| 1010 (base 2) to decimal | 1x2^3 + 0x2^2 + 1x2^1 + 0x2^0 | 10 (base 10) |
| 25 (base 10) to binary | Repeated division by 2 | 11001 (base 2) |
| 255 (base 10) to hexadecimal | Repeated division by 16 | FF (base 16) |
| A (base 16) to binary | A = 10, then 10 in base 2 | 1010 (base 2) |
| 777 (base 8) to decimal | 7x8^2 + 7x8^1 + 7x8^0 | 511 (base 10) |
| Z (base 36) to decimal | Z = 35 | 35 (base 10) |
Number Systems and Base Conversion Guide
1) What Is a Number System?
A number system is a structured way to represent quantities using a defined set of symbols and place values. The familiar everyday system is decimal, or base 10, where each position represents a power of 10. The rightmost digit is the ones place, the next digit is the tens place, then hundreds, thousands, and so on. That logic feels natural because people learn it early, but it is only one version of a more general positional idea.
In a positional system, the base determines how many unique symbols can appear before the next position is needed. Decimal uses ten symbols: 0 through 9. Binary uses two symbols: 0 and 1. Octal uses eight symbols: 0 through 7. Hexadecimal uses sixteen symbols: 0 through 9 and A through F. Once you understand that rule, the rest of base conversion becomes much easier, because the mechanics are identical across systems. Only the base changes.
This matters because the same underlying quantity can be written in many different ways. Just as the word for a concept can change between languages while the concept stays the same, the numeral system can change while the integer stays the same. A programmer might prefer 0xFF, a hardware engineer might think in 11111111, and a general user might say 255. They are not arguing about different values. They are choosing the representation that is easiest for the current task.
Number systems are important in math because they teach place value, powers, and structure. In computer science, they are essential because computers store and process data in binary, while software developers often read and write that data in hexadecimal or decimal. In electronics, networking, and embedded systems, switching among bases is routine. That is why a strong number converter is more than a convenience tool. It is a bridge between human-friendly and machine-friendly notation.
2) Types of Number Systems
The most common systems on this page are binary, octal, decimal, and hexadecimal. Decimal is the standard human system. Binary is the standard machine-oriented system. Octal is less common today than it once was, but it still matters in certain programming contexts because it groups binary digits in clean 3-bit blocks. Hexadecimal remains a core technical language because it groups binary digits in 4-bit blocks and compresses long binary sequences into a more readable form.
The page also supports extended bases up to 36. That range is practical because digits 0-9 plus letters A-Z provide exactly 36 symbols. Extended bases appear in algorithm exercises, compact codes, URL-safe identifiers, and some application-specific numbering schemes. Most everyday users will never need base 29 or base 36, but students and developers often do, and supporting them in the same tool reduces friction.
The key thing to remember is that no numeral system is magically more correct than another. The best base is the one that fits the job. Decimal is easy for general arithmetic and human communication. Binary is natural for logic states. Hexadecimal is efficient for byte-oriented inspection. Octal offers shorter notation when 3-bit grouping is useful. Extended bases can pack more information into fewer characters. Each system reveals a different kind of clarity.
That is also why confusion happens so often. People see a new string of symbols and think the value itself has changed. In reality, only the format has changed. A strong educational number converter therefore does two jobs at once: it computes the new representation correctly, and it teaches the user why the value stayed the same all along.
3) Binary System Explained
Binary is base 2, which means only two symbols are available: 0 and 1. This aligns naturally with many digital systems because electrical and logical states are often modeled as two-state conditions such as off/on, false/true, or low/high. When people say computers "use binary," they mean that digital hardware fundamentally stores and manipulates information in structures that can be interpreted through these two-state patterns.
Binary looks harder than decimal at first because the strings are longer. The same value that takes three decimal digits might take eight or more binary digits. But binary is very regular. Every place is a power of 2: ones, twos, fours, eights, sixteens, and so on. Once you learn that, it becomes straightforward to decode. For example, 1101 in binary means 1x2^3 + 1x2^2 + 0x2^1 + 1x2^0, which equals 13 in decimal.
Binary is especially important in programming because bit operations are everywhere. Flags, permissions, masks, checksums, compression, data storage, packet formats, and many hardware registers all rely on binary thinking. Even if a developer writes source code in a high-level language, understanding binary helps explain why a value occupies a certain number of bits, why a mask isolates a certain field, or why a byte boundary matters in a protocol.
Binary also connects directly to bit width. An unsigned 8-bit value can represent 256 distinct patterns, from 0 to 255. A 16-bit value can represent far more. That is why this converter includes bit-length views. They help users see whether a number fits comfortably into 8 bits, 16 bits, or 32 bits, instead of assuming the system will pad or truncate automatically.
| Concept | Equivalent | Why it matters |
|---|---|---|
| 1 bit | 2 values | A bit can represent 0 or 1 |
| 1 nibble | 4 bits | One hexadecimal digit maps to one nibble |
| 1 byte | 8 bits | Two hexadecimal digits map neatly to one byte |
| 1 octal digit | 3 bits | Useful for compact binary grouping |
| 1 hexadecimal digit | 4 bits | Useful for compact byte-oriented representation |
4) Hexadecimal System Explained
Hexadecimal is base 16. It uses the ten familiar digits 0 through 9, then continues with A, B, C, D, E, and F for the values 10 through 15. Hexadecimal matters because it compresses binary efficiently: one hex digit corresponds to exactly four binary bits. That makes long machine values far easier to read. A full byte, for example, always becomes two hex digits.
This is one reason developers, systems engineers, and security practitioners rely on hex so heavily. Instead of reading 11111111, they can read FF. Instead of parsing a 32-bit binary pattern by eye, they can work with eight hex digits. Memory dumps, register values, color codes, hashes, encoded data, and protocol diagnostics often use hexadecimal because it is more compact than binary without losing the direct structural relationship to bits.
The page gives you control over letter casing because different environments prefer different styles. Some teams want uppercase FF for visual clarity. Others want lowercase ff to match language conventions or coding standards. The underlying value does not change. Only the typography changes, which is why casing is handled as a display option rather than a numerical option.
Another helpful feature is prefix handling. Many programmers use 0x to mark hexadecimal input explicitly. That is why the converter can read 0x2A when auto-detect is enabled or when base 16 is selected directly. This reduces avoidable mistakes and makes it easier to paste values from source code, logs, or debugger output.
| Hex value | Decimal equivalent | Typical interpretation |
|---|---|---|
| 0x0F | 15 decimal | One byte fragment often written as 0000 1111 in binary |
| 0x2A | 42 decimal | Classic programmer example |
| 0xFF | 255 decimal | Maximum unsigned value for 8 bits |
| 0x7FFF | 32767 decimal | Common signed 16-bit positive limit |
| 0xFFFFFFFF | 4294967295 decimal | Maximum unsigned 32-bit value |
5) How Base Conversion Works
Base conversion is easier to understand when you separate it into two ideas. First, decode the source representation into the actual integer it describes. Second, re-encode that same integer in the target representation. This page exposes both stages so users can learn the method instead of treating the tool like a black box.
The source-to-decimal step uses positional expansion. Each digit gets multiplied by a power of the source base determined by its position. This is not unique to binary or hexadecimal. It is the same logic used in decimal numbers every day. The only difference is the base. Once users see that, number systems stop looking mysterious and start looking consistent.
The decimal-to-target step uses repeated division. Divide the integer by the target base, keep the remainder, and continue with the quotient until the quotient reaches zero. Then reverse the remainder order. This is why base conversion is so teachable: the procedure is systematic. The target digits are not guessed. They are generated by the structure of the target base itself.
For very large integers, manual conversion becomes tedious fast. That is where a good number converter earns its place. The tool preserves the exact integer with BigInt logic, validates every digit before converting, and still shows the bridge steps so students and developers can confirm the reasoning. That combination is much better than a tool that returns an answer with no explanation, or worse, a tool that silently truncates or rounds.
6) Conversion Examples
Worked examples are the fastest way to make base conversion feel intuitive. Consider 1010 in binary. The ones place contributes 0, the twos place contributes 2, the fours place contributes 0, and the eights place contributes 8. Together they make 10 in decimal. Now go the other direction: take 25 in decimal and divide by 2 repeatedly. The remainders build 11001, so 25 in decimal becomes 11001 in binary.
Hexadecimal examples are equally helpful. To convert 255 in decimal to hexadecimal, divide by 16. The first remainder is 15, which is F. The next remainder is also 15, again F. Reading upward gives FF. To convert A from hexadecimal to binary, note that A is 10 in decimal, and 10 in decimal is 1010 in binary. Once you understand the letter mapping, hex conversion stops being intimidating.
Octal examples show why grouping matters. The octal value 17 equals 1x8^1 + 7x8^0 = 15 in decimal. The same value in binary is 1111. Because each octal digit corresponds to 3 bits, the conversion between octal and binary often feels cleaner than the conversion between decimal and binary. This is one reason octal still shows up in some technical workflows.
Extended-base examples show the generality of the system. In base 36, Z represents 35. That means a short string can encode a large decimal value compactly. The page supports this range directly, which is useful when debugging compact IDs or validating algorithm exercises that use nonstandard bases.
| Direction | Input | Output | Typical use |
|---|---|---|---|
| Binary to decimal | 110010 | 50 | Useful when checking bit strings |
| Decimal to hexadecimal | 4096 | 1000 | Useful when powers of 16 matter |
| Hexadecimal to binary | 1F | 11111 | Useful when expanding compact debug values |
| Octal to binary | 17 | 1111 | Useful in older Unix-style permission contexts |
| Base 36 to decimal | HELLO | 29234652 | Useful for compact identifier decoding |
7) Programming Applications
Number-system conversion shows up constantly in programming. A developer reading a memory dump may need to convert hex bytes into binary to inspect flags. A student learning data structures may need to translate decimal values into binary to understand bit shifts. A network engineer may need to inspect fields that are easier to reason about in hexadecimal than in decimal. Even front-end developers encounter hexadecimal through color values and encoded identifiers.
The important point is that different bases reveal different patterns. Binary reveals the raw bit structure. Hexadecimal reveals nibble and byte patterns compactly. Decimal remains the most accessible for general arithmetic. Octal sometimes provides a simpler grouping for permission masks or legacy systems. Good technical work often involves moving among these views quickly rather than treating any one of them as universally best.
This is also where display rules matter. Prefixes are useful because they label intent. When a value is written as 0x2A, nobody has to guess that it is hexadecimal. Grouped binary is useful because raw bit strings become hard to scan once they get long. Uppercase or lowercase hex can matter for consistency in logs, source code, and documentation. None of these are mathematical changes, but they materially improve comprehension and reduce mistakes.
If your workflow extends beyond base conversion into storage sizes, binary labels, or digital capacity questions, jump to the data storage converter. If the task is broader symbolic or arithmetic follow-up work, the scientific calculator is the better next step.
| Use case | Best view | Why |
|---|---|---|
| Programming and debugging | Hex and binary | Memory dumps, masks, flags, IDs, and low-level data |
| Computer science education | Binary, decimal, octal, hex | Learning how positional systems and machine data work |
| Networking and storage | Binary and hex | Packet fields, byte counts, checksums, and data inspection |
| Embedded and electronics work | Binary and hex | Registers, opcodes, bit fields, and hardware settings |
| General math practice | Any supported base | Understanding powers, place value, and numeral-system logic |
8) How to Use This Converter Well
The safest workflow is simple. First, identify the numeral system the input actually uses. If the value comes from source code with a 0x prefix, it is probably hexadecimal. If it comes from a binary exercise with only 0s and 1s, it is base 2. If it comes from a debugger or register map, the surrounding context may imply hex or binary even when the prefix is missing.
Second, choose the target representation based on the task. If you want human readability, decimal is usually best. If you want to inspect bit patterns, binary is best. If you want a compact machine-friendly notation, hexadecimal is often best. If you are debugging or teaching yourself the relationship between systems, turn on the explanation panel and inspect the bridge steps instead of only copying the final answer.
Third, be deliberate about display. Prefixes improve clarity when sharing results with other people. Grouped binary is easier to scan in chunks. Uppercase hex can improve legibility in technical notes. Lowercase hex may match your language or team convention. Those choices do not change the integer, but they do change how easy the result is to read correctly.
Finally, keep scope in mind. This page is intentionally strong at exact whole-number conversion. If you are working with signed fixed-width types, floating-point bit patterns, arbitrary-base fractions, or bitwise operations as operations rather than representations, treat those as adjacent but distinct problems. This tool helps with the representation layer. It does not replace every possible programming calculator.
9) Common Mistakes
The most common mistake is entering a digit that the chosen base cannot represent. Binary does not allow 2. Octal does not allow 8 or 9. Hexadecimal does not allow G. Base 12 does not allow the letter Z. Good conversion tools reject these inputs instead of guessing, because silent guessing creates false confidence.
Another common mistake is prefix confusion. Many people paste 0xFF into a converter while the source base is still set to decimal and auto-detect is turned off. The right fix is not to hope the tool interprets intent magically. The right fix is to align the source base with the prefix or let the page auto-detect the prefix explicitly.
A subtler mistake is confusing the value with its representation. The decimal number 255 is not somehow "more real" than the hexadecimal number FF. They are just two valid descriptions of the same integer. This distinction matters because many programming mistakes come from treating a display format as if it were a different quantity.
People also make errors around bit width. Seeing 11111111 does not automatically mean "8-bit unsigned maximum" unless the context says so. The same magnitude can be written as 11111111, 0000000011111111, or 00000000000000000000000011111111 depending on the intended width. The converter therefore shows bit-length views as optional interpretations, not as hidden assumptions.
| Mistake | What goes wrong | Better approach |
|---|---|---|
| Invalid digit in the selected base | Typing 2 in binary or G in hexadecimal | Match every digit to the rules of the selected base before converting. |
| Mixing prefixes with the wrong base | Using 0x while base 10 is selected and auto-detect is off | Either choose the matching source base or enable prefix auto-detect. |
| Forgetting letter values | Treating A as 1 instead of 10 in hexadecimal | Remember that A = 10, B = 11, and so on for higher bases. |
| Confusing value with representation | Thinking FF and 255 are different quantities | The integer stays the same; only the numeral system changes. |
| Assuming fixed-width storage automatically | Believing every binary result should show 8 or 32 digits | Choose a bit width intentionally; the same value can be written with or without left padding. |
| Using decimal fractions in an integer-only base workflow | Typing 10.5 and expecting exact arbitrary-base fraction support | Use whole-number inputs for deterministic integer conversion on this page. |
10) Final Thoughts
Understanding number systems is one of those skills that pays off far beyond the classroom. It improves your intuition for place value, powers, and representation in pure math. It helps you read byte-oriented data, debug low-level values, and reason about computer behavior in programming. It also helps you recognize when two notations are really the same integer viewed through different lenses.
A strong number converter should therefore do more than translate symbols. It should validate inputs clearly, preserve exact values, expose the logic behind the conversion, and present the result in a format that suits real work. That is the goal of this CalculatorWallah page. It is designed to be fast enough for quick lookups and detailed enough for learning and technical reference.
If you use it regularly, the most valuable habit is to stop asking only "what is the answer?" and start asking "what does this representation reveal?" Binary reveals bit structure. Hexadecimal reveals byte-friendly patterns. Decimal reveals human-scale arithmetic. Extended bases reveal how general place-value logic really is. Once that clicks, base conversion stops feeling like a memorization task and starts feeling like a coherent system.
Use the converter whenever you need a fast number-system answer, but keep the explanations in view long enough to build intuition. That combination of speed and understanding is what makes base conversion genuinely useful instead of mechanically correct but forgettable.
Frequently Asked Questions
Related Calculators
Scientific Calculator
Use the scientific calculator for follow-on arithmetic, exponents, logarithms, and general math after finishing the base conversion.
Use Scientific CalculatorMath Calculators
Browse the math hub when number-system work expands into equation solving, angle conversion, or broader formula workflows.
Use Math CalculatorsData Storage Converter
Use the data storage converter when binary and hexadecimal thinking turns into bit, byte, KB, MB, GB, or storage-capacity questions.
Use Data Storage ConverterDigital Calculators
Use the digital calculators hub as the closest live route for programming-tool and digital-representation follow-up work on CalculatorWallah.
Use Digital CalculatorsMath Equation Solver
Move to the equation solver when the numeral-system conversion is only one step inside a larger algebra or formula problem.
Use Math Equation SolverSources & References
- 1.MDN - parseInt()(Accessed April 2026)
- 2.MDN - BigInt(Accessed April 2026)
- 3.MDN - Number.prototype.toString()(Accessed April 2026)
- 4.Python Documentation - Built-in Functions: int(Accessed April 2026)
- 5.Python Documentation - Built-in Types: Numeric Types(Accessed April 2026)