Base | Representation |
---|---|
bin | 11101000111101010110… |
… | …110101101001011010000 |
3 | 21002022012002200202000220 |
4 | 131013222312231023100 |
5 | 230241223100031000 |
6 | 4131143113513040 |
7 | 264401060240001 |
oct | 35075266551320 |
9 | 7068162622026 |
10 | 2001100002000 |
11 | 701730867650 |
12 | 2839b0412780 |
13 | 11691a415c28 |
14 | 6cbd49cd1a8 |
15 | 370be8641a0 |
hex | 1d1eadad2d0 |
2001100002000 has 160 divisors (see below), whose sum is σ = 7038050857344. Its totient is φ = 485115136000.
The previous prime is 2001100001987. The next prime is 2001100002047. The reversal of 2001100002000 is 2000011002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 2001100002000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15093849 + ... + 15225848.
Almost surely, 22001100002000 is an apocalyptic number.
2001100002000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2001100002000 is an abundant number, since it is smaller than the sum of its proper divisors (5036950855344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001100002000 is a wasteful number, since it uses less digits than its factorization.
2001100002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30319734 (or 30319718 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 2001100002000 its reverse (2000011002), we get a palindrome (2003100013002).
The spelling of 2001100002000 in words is "two trillion, one billion, one hundred million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •