Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …010111010011100001100 |
3 | 21002012100110000221021210 |
4 | 131012221102322130030 |
5 | 230232000011200413 |
6 | 4130442023054420 |
7 | 264331603232643 |
oct | 35065122723414 |
9 | 7065313027253 |
10 | 2000000100108 |
11 | 701216a0a01a |
12 | 283743ba1410 |
13 | 1167a359aaca |
14 | 6cb2c8b835a |
15 | 37057eec3c3 |
hex | 1d1a94ba70c |
2000000100108 has 12 divisors (see below), whose sum is σ = 4666666900280. Its totient is φ = 666666700032.
The previous prime is 2000000100073. The next prime is 2000000100151. The reversal of 2000000100108 is 8010010000002.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×20000001001082 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 166666675009 = 2000000100108 / (2 + 0 + 0 + 0 + 0 + 0 + 0 + 1 + 0 + 0 + 1 + 0 + 8).
It is a junction number, because it is equal to n+sod(n) for n = 2000000100093 and 2000000100102.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83333337493 + ... + 83333337516.
Almost surely, 22000000100108 is an apocalyptic number.
It is an amenable number.
2000000100108 is an abundant number, since it is smaller than the sum of its proper divisors (2666666800172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000000100108 is a wasteful number, since it uses less digits than its factorization.
2000000100108 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166666675016 (or 166666675014 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
The spelling of 2000000100108 in words is "two trillion, one hundred thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •