Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …111110010001101010101 |
3 | 21002101210120021110020012 |
4 | 131020213013302031111 |
5 | 230300310421041041 |
6 | 4131431313250005 |
7 | 264435115442426 |
oct | 35104707621525 |
9 | 7071716243205 |
10 | 2002111112021 |
11 | 7020aa589569 |
12 | 284032b63905 |
13 | 116a4ba42c97 |
14 | 6cc8cdcd64d |
15 | 3712d4dc3eb |
hex | 1d2271f2355 |
2002111112021 has 8 divisors (see below), whose sum is σ = 2026100736000. Its totient is φ = 1978262190160.
The previous prime is 2002111111993. The next prime is 2002111112081. The reversal of 2002111112021 is 1202111112002.
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 2002111112021 - 214 = 2002111095637 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 = 2002111111987 and 2002111112005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002111112081) 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, 35146901 + ... + 35203818.
It is an arithmetic number, because the mean of its divisors is an integer number (253262592000).
Almost surely, 22002111112021 is an apocalyptic number.
It is an amenable number.
2002111112021 is a deficient number, since it is larger than the sum of its proper divisors (23989623979).
2002111112021 is a wasteful number, since it uses less digits than its factorization.
2002111112021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70351059.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2002111112021 its reverse (1202111112002), we get a palindrome (3204222224023).
The spelling of 2002111112021 in words is "two trillion, two billion, one hundred eleven million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •