Base | Representation |
---|---|
bin | 1001001100100010110111… |
… | …0001101011000100111010 |
3 | 1022210121120102000111012110 |
4 | 2103020231301223010322 |
5 | 2311130033434323002 |
6 | 33300552421553150 |
7 | 2062335001350354 |
oct | 223105561530472 |
9 | 38717512014173 |
10 | 10111121011002 |
11 | 324911423a300 |
12 | 1173729b757b6 |
13 | 58462298173b |
14 | 26d5491600d4 |
15 | 128030671e6c |
hex | 9322dc6b13a |
10111121011002 has 24 divisors (see below), whose sum is σ = 22227753629088. Its totient is φ = 3063976063720.
The previous prime is 10111121010997. The next prime is 10111121011007. The reversal of 10111121011002 is 20011012111101.
It is an interprime number because it is at equal distance from previous prime (10111121010997) and next prime (10111121011007).
It is a super-2 number, since 2×101111210110022 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10111121011007) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6963581238 + ... + 6963582689.
It is an arithmetic number, because the mean of its divisors is an integer number (926156401212).
Almost surely, 210111121011002 is an apocalyptic number.
10111121011002 is an abundant number, since it is smaller than the sum of its proper divisors (12116632618086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111121011002 is a wasteful number, since it uses less digits than its factorization.
10111121011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13927163954 (or 13927163943 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10111121011002 its reverse (20011012111101), we get a palindrome (30122133122103).
The spelling of 10111121011002 in words is "ten trillion, one hundred eleven billion, one hundred twenty-one million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •