Base | Representation |
---|---|
bin | 1010000110101111101101… |
… | …0001001011001101010011 |
3 | 1110100012102202122021122222 |
4 | 2201223323101023031103 |
5 | 2424020312224323102 |
6 | 35344153504251255 |
7 | 2224512651205301 |
oct | 241537321131523 |
9 | 43305382567588 |
10 | 11111001011027 |
11 | 35a4170453465 |
12 | 12b5477910b2b |
13 | 6279bc123378 |
14 | 2a5abd68b271 |
15 | 1440515d2aa2 |
hex | a1afb44b353 |
11111001011027 has 2 divisors, whose sum is σ = 11111001011028. Its totient is φ = 11111001011026.
The previous prime is 11111001011009. The next prime is 11111001011059. The reversal of 11111001011027 is 72011010011111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11111001011027 - 226 = 11110933902163 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11111001010996 and 11111001011014.
It is not a weakly prime, because it can be changed into another prime (11111001091027) 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, 5555500505513 + 5555500505514.
It is an arithmetic number, because the mean of its divisors is an integer number (5555500505514).
Almost surely, 211111001011027 is an apocalyptic number.
11111001011027 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111001011027 is an equidigital number, since it uses as much as digits as its factorization.
11111001011027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 17.
Adding to 11111001011027 its reverse (72011010011111), we get a palindrome (83122011022138).
The spelling of 11111001011027 in words is "eleven trillion, one hundred eleven billion, one million, eleven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •