Base | Representation |
---|---|
bin | 11101001000100000100… |
… | …011110010000110110000 |
3 | 21002101111220002202012001 |
4 | 131020200203302012300 |
5 | 230300044224323440 |
6 | 4131412341343344 |
7 | 264432310550515 |
oct | 35104043620660 |
9 | 7071456082161 |
10 | 2002001011120 |
11 | 702053419090 |
12 | 284002107b54 |
13 | 116a31ca3a16 |
14 | 6cc7c52d30c |
15 | 371239deb9a |
hex | 1d2208f21b0 |
2002001011120 has 80 divisors (see below), whose sum is σ = 5376496873248. Its totient is φ = 685176811520.
The previous prime is 2002001011039. The next prime is 2002001011123. The reversal of 2002001011120 is 211101002002.
It is a tau number, because it is divible by the number of its divisors (80).
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 = 2002001011097 and 2002001011106.
It is not an unprimeable number, because it can be changed into a prime (2002001011123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66896839 + ... + 66926758.
Almost surely, 22002001011120 is an apocalyptic number.
2002001011120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002001011120 is an abundant number, since it is smaller than the sum of its proper divisors (3374495862128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002001011120 is a wasteful number, since it uses less digits than its factorization.
2002001011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133823638 (or 133823632 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2002001011120 its reverse (211101002002), we get a palindrome (2213102013122).
The spelling of 2002001011120 in words is "two trillion, two billion, one million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •