Base | Representation |
---|---|
bin | 11101010001110101010… |
… | …000101110001001000101 |
3 | 21010100100120120021211011 |
4 | 131101311100232021011 |
5 | 230431100033341401 |
6 | 4140150000042221 |
7 | 265235350631350 |
oct | 35216520561105 |
9 | 7110316507734 |
10 | 2012012012101 |
11 | 706320367313 |
12 | 285b36903371 |
13 | 117969043540 |
14 | 6d54bd17297 |
15 | 3750c822451 |
hex | 1d47542e245 |
2012012012101 has 32 divisors (see below), whose sum is σ = 2479599360000. Its totient is φ = 1589816458944.
The previous prime is 2012012012093. The next prime is 2012012012113. The reversal of 2012012012101 is 1012102102102.
It is not a de Polignac number, because 2012012012101 - 23 = 2012012012093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012012012191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 402480400 + ... + 402485398.
It is an arithmetic number, because the mean of its divisors is an integer number (77487480000).
Almost surely, 22012012012101 is an apocalyptic number.
It is an amenable number.
2012012012101 is a deficient number, since it is larger than the sum of its proper divisors (467587347899).
2012012012101 is a wasteful number, since it uses less digits than its factorization.
2012012012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9985.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2012012012101 its reverse (1012102102102), we get a palindrome (3024114114203).
Subtracting from 2012012012101 its reverse (1012102102102), we obtain a palindrome (999909909999).
The spelling of 2012012012101 in words is "two trillion, twelve billion, twelve million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •