Base | Representation |
---|---|
bin | 11101010000111001000… |
… | …100101000011011100100 |
3 | 21010020202012110000210002 |
4 | 131100321010220123210 |
5 | 230422013031210040 |
6 | 4135501444320432 |
7 | 265201336514066 |
oct | 35207104503344 |
9 | 7106665400702 |
10 | 2011002210020 |
11 | 705952359041 |
12 | 2858b46a3118 |
13 | 117837a8390b |
14 | 6d493b77736 |
15 | 3749dd56a15 |
hex | 1d4391286e4 |
2011002210020 has 24 divisors (see below), whose sum is σ = 4445373307200. Its totient is φ = 762063995232.
The previous prime is 2011002209989. The next prime is 2011002210029. The reversal of 2011002210020 is 200122001102.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2011002209983 and 2011002210010.
It is not an unprimeable number, because it can be changed into a prime (2011002210029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2646055160 + ... + 2646055919.
It is an arithmetic number, because the mean of its divisors is an integer number (185223887800).
Almost surely, 22011002210020 is an apocalyptic number.
2011002210020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2011002210020 is an abundant number, since it is smaller than the sum of its proper divisors (2434371097180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011002210020 is a wasteful number, since it uses less digits than its factorization.
2011002210020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5292111107 (or 5292111105 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2011002210020 its reverse (200122001102), we get a palindrome (2211124211122).
The spelling of 2011002210020 in words is "two trillion, eleven billion, two million, two hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •