Base | Representation |
---|---|
bin | 1010000111111011000100… |
… | …0100111000011111000111 |
3 | 1110102010122122010211220001 |
4 | 2201332301010320133013 |
5 | 2424333230131023421 |
6 | 35401341133422131 |
7 | 2226130166213026 |
oct | 241766104703707 |
9 | 43363578124801 |
10 | 11131231111111 |
11 | 3601801854041 |
12 | 12b938293a947 |
13 | 6298943939a7 |
14 | 2a6a7c34c8bd |
15 | 144837651691 |
hex | a1fb11387c7 |
11131231111111 has 2 divisors, whose sum is σ = 11131231111112. Its totient is φ = 11131231111110.
The previous prime is 11131231111073. The next prime is 11131231111129. The reversal of 11131231111111 is 11111113213111.
It is a m-pointer prime, because the next prime (11131231111129) can be obtained adding 11131231111111 to its product of digits (18).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11131231111111 - 213 = 11131231102919 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11131231111141) 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, 5565615555555 + 5565615555556.
It is an arithmetic number, because the mean of its divisors is an integer number (5565615555556).
Almost surely, 211131231111111 is an apocalyptic number.
11131231111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11131231111111 is an equidigital number, since it uses as much as digits as its factorization.
11131231111111 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 11131231111111 its reverse (11111113213111), we get a palindrome (22242344324222).
The spelling of 11131231111111 in words is "eleven trillion, one hundred thirty-one billion, two hundred thirty-one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •