TheBinaryKit

Binary converter: exact base 2–36 conversions

Use this binary converter for exact integer conversions between bases 2–36. Check decimal and hexadecimal values, follow the steps, and copy the result.

Input value

Load example

Calculation runs in your browser. Inputs are not sent to a conversion API.

Result

2D
Decimal check
45
Hexadecimal
2D

Calculation steps

Division steps show the magnitude. Read remainders in reverse; at most 64 steps are shown. The result is complete.

  1. 1. 45 ÷ 16 = 2; r = D
  2. 2. 2 ÷ 16 = 0; r = 2

Use the binary converter for numbers, not text

Need the same integer in binary, decimal, hexadecimal, or a less common base? This binary converter lets you select both bases explicitly and returns an exact result with independent decimal and hexadecimal checks. Start with the base used by your source, not the base you want to obtain.

The binary converter starts with 101101 in base 2 and returns 2D when the destination is base 16. The decimal check is 45, so you can compare all three representations without opening separate tabs. Changing an input clears the previous answer, preventing an old result from appearing to describe a new number.

After a successful calculation, use Swap bases in the binary converter to move the answer into the input and reverse the direction. Calculate again to check that you recover the original value. Sample buttons load complete examples, including the appropriate bases; Clear removes the operands while restoring the default settings.

All conversion arithmetic runs in your browser.

Choose the input base before reading the digits

The binary converter validates digits against the input base you select. Before calculating, check the allowed alphabet: binary uses 0 and 1, octal uses 0–7, decimal uses 0–9, and hexadecimal extends that alphabet through F. A valid-looking string can still represent the wrong quantity if you choose the wrong base.

The binary converter supports every integer base from 2 through 36, assigning A through Z to digit values ten through thirty-five. Letter case does not change a digit’s value. A digit must be smaller than its base: 2 is invalid in binary, 8 is invalid in octal, and G is invalid in hexadecimal.

A binary converter cannot infer the intended quantity from a familiar-looking digit string alone. For example, 101 in base 2 is five, while 101 in base 10 is one hundred and one. Always select the input base explicitly rather than guessing from the appearance of the number.

Binary converter example: 101101 to 2D

Try the binary converter with 101101 in base 2 and select base 16 as the destination. The answer should be 2D; tracing the value through decimal explains why. Its binary place values contribute 32, 8, 4, and 1, which add up to 45.

For this binary converter example, divide 45 by 16 to obtain quotient 2 and remainder 13, written D. Divide the quotient 2 by 16 once more: the quotient becomes zero and the remainder is 2. Read those remainders in reverse order to get 2D.

Check the binary converter result by grouping 101101 into 0010 and 1101, which represent hexadecimal 2 and D. These methods agree because sixteen is two to the fourth power. Grouping is convenient for binary and hexadecimal, but repeated division also works for unrelated bases such as seven and thirty-one.

Check long integers without floating-point rounding

Large integers deserve a precision check, not a rounded approximation. The binary converter keeps their complete integer value throughout the operation, including low-order bits that could disappear in a floating-point conversion. Use the trace to understand the method and the result field to obtain the complete numeral.

The binary converter retains low-order bits even when the input is too large for ordinary floating-point integer precision. The trace repeatedly divides the nonnegative magnitude by the target base and records each remainder. Read remainders from the last step back to the first to reconstruct the output.

For a negative value, the binary converter converts the magnitude and then restores the mathematical minus sign. The trace displays at most 64 divisions to keep the page responsive; the main answer is still complete. A truncated trace is therefore a display limit, not a rounded numeric result.

Binary converter input: signs, separators, and width

Formatting should improve readability without silently selecting a signed representation. In the binary converter, a leading minus sign means a negative mathematical integer; spaces and underscores group digits within that integer. They do not define separate values or specify a register width.

The binary converter removes leading zeros from a normalized numeral because they do not change its value. The converter does not preserve a register width or interpret a leading one as a negative sign. In particular, 11111111 means positive 255, not minus one; two’s complement requires a separate width-aware interpretation.

Enter digits in the binary converter without programming prefixes such as 0b or 0x. Decimal fractions, decimal points, exponent notation, and fractions written with a slash are outside this integer tool’s scope. Inputs longer than 4,096 characters are rejected before the arithmetic begins.

Match the conversion to your actual task

A useful result begins with the right question: are your bits a number, a character code, or file data? Use the binary converter when you need the numeric quantity written in another base. Character decoding and file recovery require their own interpretation rules, even when their inputs contain the same zeros and ones.

The binary converter changes a numeral’s base without decoding file structure or character meanings. The binary number 1000001 is decimal 65, while a character decoder may interpret that value as the letter A using ASCII. Those are related but different questions.

After using the binary converter to check a numeric value, choose the ASCII, text, or focused base-pair page when you need its specific interpretation or teaching method. Keeping these tasks distinct helps you catch a wrong assumption before copying a technically correct but irrelevant result.

Frequently asked questions

Does the binary converter round long integers?

The binary converter uses exact integer arithmetic for every accepted input. A trace that stops after 64 divisions does not shorten the main result. The separate 4,096-character limit prevents oversized inputs; exceeding it produces a validation error rather than a rounded number that might be mistaken for the full answer.

Why does the binary converter reject a digit that worked before?

The binary converter checks digits against the currently selected source base. F belongs to hexadecimal but not decimal; 8 belongs to decimal but not octal. Verify that the source base is correct, remove prefixes and fraction notation, and enter one integer rather than a list of independent values.

How do I check a result by reversing the conversion?

Calculate once, then use Swap bases in the binary converter. The answer moves into the input and the two bases reverse. Calculate again to recover the original quantity. Compare numeric values, allowing for removed leading zeros and uppercase letters; those formatting changes do not indicate an arithmetic error.

Can binary converter results be stored in an eight-bit register?

The binary converter gives a mathematical integer, so storage still depends on the register’s range and signed representation. An unsigned eight-bit register accepts zero through 255. A negative value needs a declared encoding, while an oversized positive value needs an explicit overflow policy rather than an assumed truncation.