Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …111101111100010110110 |
3 | 21002101210120020220021002 |
4 | 131020213013233202312 |
5 | 230300310420213420 |
6 | 4131431313123302 |
7 | 264435115365551 |
oct | 35104707574266 |
9 | 7071716226232 |
10 | 2002111101110 |
11 | 7020aa58134a |
12 | 284032b59532 |
13 | 116a4ba3b023 |
14 | 6cc8cdc9698 |
15 | 3712d4d9075 |
hex | 1d2271ef8b6 |
2002111101110 has 16 divisors (see below), whose sum is σ = 3640952560896. Its totient is φ = 792588311808.
The previous prime is 2002111101073. The next prime is 2002111101127. The reversal of 2002111101110 is 111011112002.
It is a super-2 number, since 2×20021111011102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2002111101091 and 2002111101100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1032015062 + ... + 1032017001.
It is an arithmetic number, because the mean of its divisors is an integer number (227559535056).
Almost surely, 22002111101110 is an apocalyptic number.
2002111101110 is a deficient number, since it is larger than the sum of its proper divisors (1638841459786).
2002111101110 is a wasteful number, since it uses less digits than its factorization.
2002111101110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2064032167.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2002111101110 its reverse (111011112002), we get a palindrome (2113122213112).
The spelling of 2002111101110 in words is "two trillion, two billion, one hundred eleven million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •