Base | Representation |
---|---|
bin | 1001001100100010110110… |
… | …1110001111011000000111 |
3 | 1022210121120100022202210011 |
4 | 2103020231232033120013 |
5 | 2311130033222023421 |
6 | 33300552350411051 |
7 | 2062334660611645 |
oct | 223105556173007 |
9 | 38717510282704 |
10 | 10111120111111 |
11 | 3249113785198 |
12 | 1173729800a87 |
13 | 584622727c66 |
14 | 26d548da8195 |
15 | 1280305454e1 |
hex | 9322db8f607 |
10111120111111 has 2 divisors, whose sum is σ = 10111120111112. Its totient is φ = 10111120111110.
The previous prime is 10111120111093. The next prime is 10111120111121. The reversal of 10111120111111 is 11111102111101.
10111120111111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10111120111111 - 29 = 10111120110599 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111120111091 and 10111120111100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111120111121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055560055555 + 5055560055556.
It is an arithmetic number, because the mean of its divisors is an integer number (5055560055556).
Almost surely, 210111120111111 is an apocalyptic number.
10111120111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111120111111 is an equidigital number, since it uses as much as digits as its factorization.
10111120111111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 10111120111111 its reverse (11111102111101), we get a palindrome (21222222222212).
The spelling of 10111120111111 in words is "ten trillion, one hundred eleven billion, one hundred twenty million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •