Base | Representation |
---|---|
bin | 11101010000000100011… |
… | …111010011110101110000 |
3 | 21010011110201102200101202 |
4 | 131100010133103311300 |
5 | 230413211210323440 |
6 | 4135234131550332 |
7 | 265140435115454 |
oct | 35200437236560 |
9 | 7104421380352 |
10 | 2010120011120 |
11 | 70553a384a41 |
12 | 2856a915b3a8 |
13 | 117727080830 |
14 | 6d40c932664 |
15 | 3744b694615 |
hex | 1d4047d3d70 |
2010120011120 has 80 divisors (see below), whose sum is σ = 5035151292192. Its totient is φ = 741885527040.
The previous prime is 2010120011111. The next prime is 2010120011131. The reversal of 2010120011120 is 211100210102.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2070359 + ... + 2882121.
Almost surely, 22010120011120 is an apocalyptic number.
2010120011120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2010120011120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2517575646096).
2010120011120 is an abundant number, since it is smaller than the sum of its proper divisors (3025031281072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010120011120 is a wasteful number, since it uses less digits than its factorization.
2010120011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 814170 (or 814164 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2010120011120 its reverse (211100210102), we get a palindrome (2221220221222).
The spelling of 2010120011120 in words is "two trillion, ten billion, one hundred twenty million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •