Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …1000001111111101001111 |
3 | 1022210121021001101101101100 |
4 | 2103020212220033331033 |
5 | 2311124312240200421 |
6 | 33300532455514143 |
7 | 2062332014210052 |
oct | 223104650177517 |
9 | 38717231341340 |
10 | 10111001100111 |
11 | 324906258949a |
12 | 11736b5988953 |
13 | 584603b89252 |
14 | 26d537268a99 |
15 | 128024d87c26 |
hex | 93226a0ff4f |
10111001100111 has 24 divisors (see below), whose sum is σ = 15082373406464. Its totient is φ = 6522252425280.
The previous prime is 10111001100091. The next prime is 10111001100133. The reversal of 10111001100111 is 11100110011101.
It is not a de Polignac number, because 10111001100111 - 217 = 10111000969039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10111001100093 and 10111001100102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111001100191) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 83816431 + ... + 83936976.
Almost surely, 210111001100111 is an apocalyptic number.
10111001100111 is a deficient number, since it is larger than the sum of its proper divisors (4971372306353).
10111001100111 is a wasteful number, since it uses less digits than its factorization.
10111001100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167753631 (or 167753628 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10111001100111 its reverse (11100110011101), we get a palindrome (21211111111212).
The spelling of 10111001100111 in words is "ten trillion, one hundred eleven billion, one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •