Base | Representation |
---|---|
bin | 11101001111111110100… |
… | …001110011010111000100 |
3 | 21010011012202020122121101 |
4 | 131033332201303113010 |
5 | 230413010110014340 |
6 | 4135220200225444 |
7 | 265135112052430 |
oct | 35177641632704 |
9 | 7104182218541 |
10 | 2010020001220 |
11 | 705498987030 |
12 | 28567b76b284 |
13 | 11770c43568a |
14 | 6d3dd53b9c0 |
15 | 374429dbc9a |
hex | 1d3fe8735c4 |
2010020001220 has 192 divisors, whose sum is σ = 5865435555840. Its totient is φ = 558612633600.
The previous prime is 2010020001193. The next prime is 2010020001229. The reversal of 2010020001220 is 221000200102.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 2010020001197 and 2010020001206.
It is not an unprimeable number, because it can be changed into a prime (2010020001229) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1523026 + ... + 2517865.
It is an arithmetic number, because the mean of its divisors is an integer number (30549143520).
Almost surely, 22010020001220 is an apocalyptic number.
2010020001220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2010020001220 is an abundant number, since it is smaller than the sum of its proper divisors (3855415554620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010020001220 is a wasteful number, since it uses less digits than its factorization.
2010020001220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4040954 (or 4040952 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 2010020001220 its reverse (221000200102), we get a palindrome (2231020201322).
The spelling of 2010020001220 in words is "two trillion, ten billion, twenty million, one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •