Base | Representation |
---|---|
bin | 1001000110001100101110… |
… | …1100001011001100001111 |
3 | 1022102012011122001021221110 |
4 | 2101203023230023030033 |
5 | 2302333300403020421 |
6 | 33134522445303103 |
7 | 2051425251412410 |
oct | 221431354131417 |
9 | 38365148037843 |
10 | 10002101220111 |
11 | 320695a425870 |
12 | 1156583564a93 |
13 | 57726a582830 |
14 | 268166215807 |
15 | 12529e64ba76 |
hex | 918cbb0b30f |
10002101220111 has 256 divisors, whose sum is σ = 18779873882112. Its totient is φ = 4568555520000.
The previous prime is 10002101220109. The next prime is 10002101220113. The reversal of 10002101220111 is 11102210120001.
It is an interprime number because it is at equal distance from previous prime (10002101220109) and next prime (10002101220113).
It is not a de Polignac number, because 10002101220111 - 21 = 10002101220109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002101220113) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 1111216611 + ... + 1111225611.
It is an arithmetic number, because the mean of its divisors is an integer number (73358882352).
Almost surely, 210002101220111 is an apocalyptic number.
10002101220111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10002101220111 is a deficient number, since it is larger than the sum of its proper divisors (8777772662001).
10002101220111 is a wasteful number, since it uses less digits than its factorization.
10002101220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9282.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10002101220111 its reverse (11102210120001), we get a palindrome (21104311340112).
The spelling of 10002101220111 in words is "ten trillion, two billion, one hundred one million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •