Base | Representation |
---|---|
bin | 1001001101001011011001… |
… | …0010010101101011111111 |
3 | 1022211122122200000212111211 |
4 | 2103102312102111223333 |
5 | 2311314324302210421 |
6 | 33305552210225251 |
7 | 2063201424461440 |
oct | 223226622255377 |
9 | 38748580025454 |
10 | 10122001210111 |
11 | 325279789199a |
12 | 1175865885227 |
13 | 585667b2198b |
14 | 26dc9c1672c7 |
15 | 12846a9499e1 |
hex | 934b6495aff |
10122001210111 has 16 divisors (see below), whose sum is σ = 11636062297600. Its totient is φ = 8625029830560.
The previous prime is 10122001210103. The next prime is 10122001210129. The reversal of 10122001210111 is 11101210022101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10122001210111 - 23 = 10122001210103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10122001210091 and 10122001210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122007210111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1471416 + ... + 4733821.
It is an arithmetic number, because the mean of its divisors is an integer number (727253893600).
Almost surely, 210122001210111 is an apocalyptic number.
10122001210111 is a deficient number, since it is larger than the sum of its proper divisors (1514061087489).
10122001210111 is a wasteful number, since it uses less digits than its factorization.
10122001210111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6206614.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10122001210111 its reverse (11101210022101), we get a palindrome (21223211232212).
The spelling of 10122001210111 in words is "ten trillion, one hundred twenty-two billion, one million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •