Base | Representation |
---|---|
bin | 1010000000010110001000… |
… | …00001001000001010001100 |
3 | 2212220101021221202100211220 |
4 | 11000023010001020022030 |
5 | 10340440310421320022 |
6 | 114443344051443340 |
7 | 4430412552526542 |
oct | 500130401101214 |
9 | 85811257670756 |
10 | 22002111120012 |
11 | 7013052151601 |
12 | 25741a65b6550 |
13 | c37a3702a53a |
14 | 560c9d24dd92 |
15 | 2824d337585c |
hex | 1402c404828c |
22002111120012 has 12 divisors (see below), whose sum is σ = 51338259280056. Its totient is φ = 7334037040000.
The previous prime is 22002111120001. The next prime is 22002111120019. The reversal of 22002111120012 is 21002111120022.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 22002111119973 and 22002111120000.
It is not an unprimeable number, because it can be changed into a prime (22002111120019) 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, 916754629989 + ... + 916754630012.
It is an arithmetic number, because the mean of its divisors is an integer number (4278188273338).
Almost surely, 222002111120012 is an apocalyptic number.
It is an amenable number.
22002111120012 is an abundant number, since it is smaller than the sum of its proper divisors (29336148160044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22002111120012 is a wasteful number, since it uses less digits than its factorization.
22002111120012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1833509260008 (or 1833509260006 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22002111120012 its reverse (21002111120022), we get a palindrome (43004222240034).
The spelling of 22002111120012 in words is "twenty-two trillion, two billion, one hundred eleven million, one hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •