Base | Representation |
---|---|
bin | 11001001111100011100001… |
… | …101111100100100011100111 |
3 | 112120002102021210110011210011 |
4 | 121033203201233210203213 |
5 | 104022423132103323421 |
6 | 1032041533014111051 |
7 | 32245636423532146 |
oct | 3117434157444347 |
9 | 476072253404704 |
10 | 111020102011111 |
11 | 324133a732a607 |
12 | 1055053364b487 |
13 | 49c41c6110917 |
14 | 1d5b58a02575d |
15 | cc7d4ab454e1 |
hex | 64f8e1be48e7 |
111020102011111 has 2 divisors, whose sum is σ = 111020102011112. Its totient is φ = 111020102011110.
The previous prime is 111020102011037. The next prime is 111020102011121. The reversal of 111020102011111 is 111110201020111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111020102011111 - 221 = 111020099913959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111020102011091 and 111020102011100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111020102011121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510051005555 + 55510051005556.
It is an arithmetic number, because the mean of its divisors is an integer number (55510051005556).
Almost surely, 2111020102011111 is an apocalyptic number.
111020102011111 is a deficient number, since it is larger than the sum of its proper divisors (1).
111020102011111 is an equidigital number, since it uses as much as digits as its factorization.
111020102011111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111020102011111 its reverse (111110201020111), we get a palindrome (222130303031222).
It can be divided in two parts, 1110201020111 and 11, that multiplied together give a palindrome (12212211221221).
The spelling of 111020102011111 in words is "one hundred eleven trillion, twenty billion, one hundred two million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •