Base | Representation |
---|---|
bin | 1010000111111010111111… |
… | …1000100110001010010111 |
3 | 1110102010121020111211210101 |
4 | 2201332233320212022113 |
5 | 2424333210021104421 |
6 | 35401335141034531 |
7 | 2226126534222565 |
oct | 241765770461227 |
9 | 43363536454711 |
10 | 11131211113111 |
11 | 36017a1535271 |
12 | 12b93780b5a47 |
13 | 6298901b145b |
14 | 2a6a79824a35 |
15 | 144835a01191 |
hex | a1fafe26297 |
11131211113111 has 2 divisors, whose sum is σ = 11131211113112. Its totient is φ = 11131211113110.
The previous prime is 11131211113093. The next prime is 11131211113129. The reversal of 11131211113111 is 11131111213111.
It is a m-pointer prime, because the next prime (11131211113129) can be obtained adding 11131211113111 to its product of digits (18).
It is a balanced prime because it is at equal distance from previous prime (11131211113093) and next prime (11131211113129).
It is a cyclic number.
It is not a de Polignac number, because 11131211113111 - 25 = 11131211113079 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11131212113111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565605556555 + 5565605556556.
It is an arithmetic number, because the mean of its divisors is an integer number (5565605556556).
Almost surely, 211131211113111 is an apocalyptic number.
11131211113111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11131211113111 is an equidigital number, since it uses as much as digits as its factorization.
11131211113111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18, while the sum is 19.
Adding to 11131211113111 its reverse (11131111213111), we get a palindrome (22262322326222).
The spelling of 11131211113111 in words is "eleven trillion, one hundred thirty-one billion, two hundred eleven million, one hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •