base_converter(`32;10;16`) returns 20

The calculator allows you to make decimal, binary, hexadecimal conversions, and more generally to any base n between 2 and 36.

The calculator allows to **convert any integer number into any base (n)**, with n between 2 and 36.
The calculator accepts between 1 and 3 parameters, it returns, depending on the number of parameters,
a number converted into binary, octal, decimal, hexadecimal or base n.

The calculator can **convert a number into base 10 (decimal), base 2 (binary), base 8 (octal) and base 16 (hexadecimal)**.
So to convert 1024 to base 2, base 8, and base 16, just enter the following expression :
base_converter(`1024`)

The calculator can **convert a number into base 16 (hexadecimal), base 2 (binary), base 8 (octal) and base 10 (decimal)**.
So to convert 11f to base 2, base 8, and base 10, just enter the following expression :
base_converter(`11f`)

The number to be converted can be given in a base other than 10. To do so, you just have to specify the base of the number to convert. Thus to convert the number 1000000 into base 2, decimal, octal, and hexadecimal, you just have to enter the following expression : base_converter(`1000000;2`), after calculation, the result of the conversion of the binary number 1000000 is returned.

The calculator can convert numbers to any base n (n must be an integer between 2 and 36),
to do so, you just have to specify the initial base and the desired base.
For example to convert the hexadecimal number 888 to base 10, the following syntax must be used :
base_converter(`888;16;10`),
after calculation, the result
of the **conversion of the hexadecimal number to a decimal number** is returned.

base_converter(number;from_base;to_base)

base_converter(`32;10;16`) returns 20

See also

- Number of arrangement of a set calculator : arrangement. To calculate online the number of arrangement of p elements of a set of n elements.
- Calculation of binomial coefficients : binomial_coefficient. A binomial coefficient calculator that allows you to calculate a binomial coefficient from two integers.
- To count the number of combinations : combination. To calculate the number of k elements of part of a set of n elements.
- Base-n converter : base_converter. The calculator allows you to make decimal, binary, hexadecimal conversions, and more generally to any base n between 2 and 36.
- Prime factorization calculator : prime_factorization. The function prime_factorization is used to calculate online the decomposition of an integer into prime factors.
- Quotient and remainder calculator : euclidean_division. The calculator allows to find online the quotient and the remainder in the euclidean division of two polynomials or two integers.
- Parity of a number : is_odd. Is_odd function returns true if the number passed is odd, false otherwise.
- Parity of a number : is_even. Is_even function returns 1 if the number is even, 0 otherwise.
- Factorial calculator : factorial. The factorial of a natural number n is the product of the positive integers less than or equal to n. The factorial calculator allows you to find this number.
- Integer calculations : integer_functions. This calculator allows you to apply special functions to an integer: prime_factorization, base_converter, factorial, percentage, permutation, perimeter, is_even, is_odd.
- Permutation calculator : permutation. To calculate online the number of permutation of a set of n elements.
- Gcd calculation online : gcd. GCD calculator that uses Euclid's algorithm to give the steps of the GCD calculation.
- Least common multiple : lcm. LCM calculator to calculate the least common multiple (LCM).
- Pythagorean theorem calculator : pythagorean. The calculator uses the Pythagorean theorem to verify that a triangle is right-angled or to find the length of one side of a right-angled triangle.
- Countdown solver : arithmetic_solver. This countdown solver allows finding a target number from a set of integer in using arithmetic operations.