Base | Representation |
---|---|
bin | 100000000001111100011… |
… | …111111011011000010101 |
3 | 21210102110021112222201110 |
4 | 200001330133323120111 |
5 | 242030334133000041 |
6 | 4403102113045233 |
7 | 315011415204444 |
oct | 40017437733025 |
9 | 7712407488643 |
10 | 2201112000021 |
11 | 779539383070 |
12 | 2b670bb56819 |
13 | 12c74407620c |
14 | 7876a514d5b |
15 | 3c3c8da8516 |
hex | 2007c7fb615 |
2201112000021 has 32 divisors (see below), whose sum is σ = 3240419857920. Its totient is φ = 1317841876800.
The previous prime is 2201111999987. The next prime is 2201112000047. The reversal of 2201112000021 is 1200002111022.
2201112000021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2201112000021 - 221 = 2201109902869 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2201111999970 and 2201112000006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201112000821) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 75420210 + ... + 75449388.
It is an arithmetic number, because the mean of its divisors is an integer number (101263120560).
Almost surely, 22201112000021 is an apocalyptic number.
It is an amenable number.
2201112000021 is a deficient number, since it is larger than the sum of its proper divisors (1039307857899).
2201112000021 is a wasteful number, since it uses less digits than its factorization.
2201112000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56817.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2201112000021 its reverse (1200002111022), we get a palindrome (3401114111043).
The spelling of 2201112000021 in words is "two trillion, two hundred one billion, one hundred twelve million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •