Base | Representation |
---|---|
bin | 1010001000011111111010… |
… | …0101000000110100111111 |
3 | 1110110002011220022012211212 |
4 | 2202013332211000310333 |
5 | 2430014004024022421 |
6 | 35410054355035035 |
7 | 2226630241440065 |
oct | 242077645006477 |
9 | 43402156265755 |
10 | 11141121314111 |
11 | 3605a17595a28 |
12 | 12bb282b9ba7b |
13 | 62a7ac3ba309 |
14 | 2a7339a90035 |
15 | 144c15a71e5b |
hex | a21fe940d3f |
11141121314111 has 2 divisors, whose sum is σ = 11141121314112. Its totient is φ = 11141121314110.
The previous prime is 11141121314093. The next prime is 11141121314207. The reversal of 11141121314111 is 11141312114111.
It is a m-pointer prime, because the next prime (11141121314207) can be obtained adding 11141121314111 to its product of digits (96).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11141121314111 - 214 = 11141121297727 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11141621314111) 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, 5570560657055 + 5570560657056.
It is an arithmetic number, because the mean of its divisors is an integer number (5570560657056).
Almost surely, 211141121314111 is an apocalyptic number.
11141121314111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11141121314111 is an equidigital number, since it uses as much as digits as its factorization.
11141121314111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 96, while the sum is 23.
Adding to 11141121314111 its reverse (11141312114111), we get a palindrome (22282433428222).
The spelling of 11141121314111 in words is "eleven trillion, one hundred forty-one billion, one hundred twenty-one million, three hundred fourteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •