Base | Representation |
---|---|
bin | 11101000110101111011… |
… | …000011100001000011000 |
3 | 21002012121120011202122011 |
4 | 131012233120130020120 |
5 | 230232202131241440 |
6 | 4130500111435304 |
7 | 264334253202415 |
oct | 35065730341030 |
9 | 7065546152564 |
10 | 2000102212120 |
11 | 701269613311 |
12 | 283772225b34 |
13 | 1167bb7a0a0c |
14 | 6cb3c29910c |
15 | 37061e6c9ea |
hex | 1d1af61c218 |
2000102212120 has 64 divisors (see below), whose sum is σ = 4801975884000. Its totient is φ = 747550798848.
The previous prime is 2000102212093. The next prime is 2000102212123. The reversal of 2000102212120 is 212122010002.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 2000102212120.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000102212123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17969955 + ... + 18080914.
Almost surely, 22000102212120 is an apocalyptic number.
2000102212120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000102212120 is an abundant number, since it is smaller than the sum of its proper divisors (2801873671880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000102212120 is a wasteful number, since it uses less digits than its factorization.
2000102212120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36050972 (or 36050968 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2000102212120 its reverse (212122010002), we get a palindrome (2212224222122).
The spelling of 2000102212120 in words is "two trillion, one hundred two million, two hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •