Base | Representation |
---|---|
bin | 1010000110000110101110… |
… | …0011101100001100000011 |
3 | 1110022011001002022120122221 |
4 | 2201201223203230030003 |
5 | 2423330300000323021 |
6 | 35335134122511511 |
7 | 2223643230226042 |
oct | 241415343541403 |
9 | 43264032276587 |
10 | 11100000011011 |
11 | 359a5356a230a |
12 | 12b3307665597 |
13 | 626957c387c2 |
14 | 2a53585da559 |
15 | 143b0a8e7241 |
hex | a186b8ec303 |
11100000011011 has 2 divisors, whose sum is σ = 11100000011012. Its totient is φ = 11100000011010.
The previous prime is 11100000010997. The next prime is 11100000011017. The reversal of 11100000011011 is 11011000000111.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (11011000000111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11100000011011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11100000010985 and 11100000011003.
It is not a weakly prime, because it can be changed into another prime (11100000011017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550000005505 + 5550000005506.
It is an arithmetic number, because the mean of its divisors is an integer number (5550000005506).
Almost surely, 211100000011011 is an apocalyptic number.
11100000011011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100000011011 is an equidigital number, since it uses as much as digits as its factorization.
11100000011011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11100000011011 its reverse (11011000000111), we get a palindrome (22111000011122).
The spelling of 11100000011011 in words is "eleven trillion, one hundred billion, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •