Base | Representation |
---|---|
bin | 11101001000100111101… |
… | …001101100010111110010 |
3 | 21002101211012000001122000 |
4 | 131020213221230113302 |
5 | 230300320210013020 |
6 | 4131432231554430 |
7 | 264435254134023 |
oct | 35104751542762 |
9 | 7071735001560 |
10 | 2002120001010 |
11 | 7021045aaa38 |
12 | 284035b2ba16 |
13 | 116a50835c3c |
14 | 6cc90264c4a |
15 | 3712e196090 |
hex | 1d227a6c5f2 |
2002120001010 has 64 divisors (see below), whose sum is σ = 5357986824960. Its totient is φ = 531998651520.
The previous prime is 2002120001003. The next prime is 2002120001017. The reversal of 2002120001010 is 101000212002.
It is an interprime number because it is at equal distance from previous prime (2002120001003) and next prime (2002120001017).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2002120000983 and 2002120001001.
It is not an unprimeable number, because it can be changed into a prime (2002120001017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13118542 + ... + 13270281.
It is an arithmetic number, because the mean of its divisors is an integer number (83718544140).
Almost surely, 22002120001010 is an apocalyptic number.
2002120001010 is an abundant number, since it is smaller than the sum of its proper divisors (3355866823950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002120001010 is a wasteful number, since it uses less digits than its factorization.
2002120001010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26389120 (or 26389114 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2002120001010 its reverse (101000212002), we get a palindrome (2103120213012).
The spelling of 2002120001010 in words is "two trillion, two billion, one hundred twenty million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •