Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …0111101010110111101111 |
3 | 1022210121112122022002002200 |
4 | 2103020231013222313233 |
5 | 2311130023130000421 |
6 | 33300551345552543 |
7 | 2062334505640551 |
oct | 223105507526757 |
9 | 38717478262080 |
10 | 10111110000111 |
11 | 3249108aa969a |
12 | 1173726345753 |
13 | 5846205c7a13 |
14 | 26d5478d54d1 |
15 | 12802e6e9726 |
hex | 9322d1eadef |
10111110000111 has 12 divisors (see below), whose sum is σ = 14697961743192. Its totient is φ = 6697805349456.
The previous prime is 10111110000097. The next prime is 10111110000133. The reversal of 10111110000111 is 11100001111101.
It is not a de Polignac number, because 10111110000111 - 211 = 10111109998063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10111110000093 and 10111110000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111110000151) 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, 3577886061 + ... + 3577888886.
It is an arithmetic number, because the mean of its divisors is an integer number (1224830145266).
Almost surely, 210111110000111 is an apocalyptic number.
10111110000111 is a deficient number, since it is larger than the sum of its proper divisors (4586851743081).
10111110000111 is a wasteful number, since it uses less digits than its factorization.
10111110000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7155775110 (or 7155775107 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10111110000111 its reverse (11100001111101), we get a palindrome (21211111111212).
The spelling of 10111110000111 in words is "ten trillion, one hundred eleven billion, one hundred ten million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •