Base | Representation |
---|---|
bin | 1001001100100110101000… |
… | …0011001011011100110001 |
3 | 1022210201011212210220000101 |
4 | 2103021222003023130301 |
5 | 2311134121322424014 |
6 | 33301241023552401 |
7 | 2062402030530442 |
oct | 223115203133461 |
9 | 38721155726011 |
10 | 10112132233009 |
11 | 3249593028374 |
12 | 117397075b701 |
13 | 58475431a761 |
14 | 26d60358d2c9 |
15 | 12808e31d474 |
hex | 9326a0cb731 |
10112132233009 has 4 divisors (see below), whose sum is σ = 10112140360804. Its totient is φ = 10112124105216.
The previous prime is 10112132233001. The next prime is 10112132233013. The reversal of 10112132233009 is 90033223121101.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 7522375863025 + 2589756369984 = 2742695^2 + 1609272^2 .
It is a cyclic number.
It is not a de Polignac number, because 10112132233009 - 23 = 10112132233001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10112132233001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1763712 + ... + 4830625.
It is an arithmetic number, because the mean of its divisors is an integer number (2528035090201).
Almost surely, 210112132233009 is an apocalyptic number.
It is an amenable number.
10112132233009 is a deficient number, since it is larger than the sum of its proper divisors (8127795).
10112132233009 is an equidigital number, since it uses as much as digits as its factorization.
10112132233009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8127794.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 10112132233009 in words is "ten trillion, one hundred twelve billion, one hundred thirty-two million, two hundred thirty-three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •