Base | Representation |
---|---|
bin | 11101001111111101011… |
… | …101001101011100011000 |
3 | 21010011011111102010011201 |
4 | 131033331131031130120 |
5 | 230412441004120440 |
6 | 4135214315003544 |
7 | 265134503162413 |
oct | 35177535153430 |
9 | 7104144363151 |
10 | 2010002020120 |
11 | 705489815616 |
12 | 2856757395b4 |
13 | 1177087ab183 |
14 | 6d3dadbab7a |
15 | 3744113919a |
hex | 1d3fd74d718 |
2010002020120 has 32 divisors (see below), whose sum is σ = 4558114828800. Its totient is φ = 797670091008.
The previous prime is 2010002020111. The next prime is 2010002020157. The reversal of 2010002020120 is 210202000102.
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 = 2010002020097 and 2010002020106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 197829765 + ... + 197839924.
It is an arithmetic number, because the mean of its divisors is an integer number (142441088400).
Almost surely, 22010002020120 is an apocalyptic number.
2010002020120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2010002020120 is an abundant number, since it is smaller than the sum of its proper divisors (2548112808680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010002020120 is a wasteful number, since it uses less digits than its factorization.
2010002020120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395669827 (or 395669823 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 2010002020120 its reverse (210202000102), we get a palindrome (2220204020222).
The spelling of 2010002020120 in words is "two trillion, ten billion, two million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •