Base | Representation |
---|---|
bin | 11101001000100111110… |
… | …001101111010001000101 |
3 | 21002101211022222012122112 |
4 | 131020213301233101011 |
5 | 230300321230010041 |
6 | 4131432345110405 |
7 | 264435311066525 |
oct | 35104761572105 |
9 | 7071738865575 |
10 | 2002122110021 |
11 | 702105810520 |
12 | 284036788405 |
13 | 116a510c3b87 |
14 | 6cc90653685 |
15 | 3712e460deb |
hex | 1d227c6f445 |
2002122110021 has 8 divisors (see below), whose sum is σ = 2259448149600. Its totient is φ = 1757348560240.
The previous prime is 2002122110003. The next prime is 2002122110033. The reversal of 2002122110021 is 1200112212002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2002122110021 - 218 = 2002121847877 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2002122109978 and 2002122110005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002122160021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3138122111 + ... + 3138122748.
It is an arithmetic number, because the mean of its divisors is an integer number (282431018700).
Almost surely, 22002122110021 is an apocalyptic number.
It is an amenable number.
2002122110021 is a deficient number, since it is larger than the sum of its proper divisors (257326039579).
2002122110021 is a wasteful number, since it uses less digits than its factorization.
2002122110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6276244899.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2002122110021 its reverse (1200112212002), we get a palindrome (3202234322023).
The spelling of 2002122110021 in words is "two trillion, two billion, one hundred twenty-two million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •