Base | Representation |
---|---|
bin | 1010000110110000001100… |
… | …0001111011011101101111 |
3 | 1110100012202211200012102002 |
4 | 2201230003001323131233 |
5 | 2424021044043411421 |
6 | 35344214435322515 |
7 | 2224516122106511 |
oct | 241540301733557 |
9 | 43305684605362 |
10 | 11111131232111 |
11 | 35a4227a06499 |
12 | 12b54b345043b |
13 | 627a100b8671 |
14 | 2a5ad2aa7bb1 |
15 | 14405cc56b0b |
hex | a1b0307b76f |
11111131232111 has 2 divisors, whose sum is σ = 11111131232112. Its totient is φ = 11111131232110.
The previous prime is 11111131232101. The next prime is 11111131232147. The reversal of 11111131232111 is 11123213111111.
It is a m-pointer prime, because the next prime (11111131232147) can be obtained adding 11111131232111 to its product of digits (36).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11111131232111 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111131232101) 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 as a sum of consecutive naturals, namely, 5555565616055 + 5555565616056.
It is an arithmetic number, because the mean of its divisors is an integer number (5555565616056).
Almost surely, 211111131232111 is an apocalyptic number.
11111131232111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111131232111 is an equidigital number, since it uses as much as digits as its factorization.
11111131232111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36, while the sum is 20.
Adding to 11111131232111 its reverse (11123213111111), we get a palindrome (22234344343222).
The spelling of 11111131232111 in words is "eleven trillion, one hundred eleven billion, one hundred thirty-one million, two hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •