Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …011100101101011001110 |
3 | 21002101210111012120102202 |
4 | 131020213003211223032 |
5 | 230300310130341420 |
6 | 4131431233521502 |
7 | 264435103211615 |
oct | 35104703455316 |
9 | 7071714176382 |
10 | 2002110012110 |
11 | 7020a99a814a |
12 | 284032713292 |
13 | 116a4b749450 |
14 | 6cc8cbc487c |
15 | 3712d371575 |
hex | 1d2270e5ace |
2002110012110 has 16 divisors (see below), whose sum is σ = 3881013254496. Its totient is φ = 739240619808.
The previous prime is 2002110012031. The next prime is 2002110012113. The reversal of 2002110012110 is 112100112002.
It is a super-2 number, since 2×20021100121102 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2002110012091 and 2002110012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002110012113) 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, 7700422994 + ... + 7700423253.
It is an arithmetic number, because the mean of its divisors is an integer number (242563328406).
Almost surely, 22002110012110 is an apocalyptic number.
2002110012110 is a deficient number, since it is larger than the sum of its proper divisors (1878903242386).
2002110012110 is a wasteful number, since it uses less digits than its factorization.
2002110012110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15400846267.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2002110012110 its reverse (112100112002), we get a palindrome (2114210124112).
The spelling of 2002110012110 in words is "two trillion, two billion, one hundred ten million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •