Base | Representation |
---|---|
bin | 11101011011010101110… |
… | …10110010100101100011 |
3 | 10120122212001221100101002 |
4 | 32231222322302211203 |
5 | 113031223421023021 |
6 | 2052255324102215 |
7 | 133023163431461 |
oct | 16555272624543 |
9 | 3518761840332 |
10 | 1011111111011 |
11 | 35a89a954071 |
12 | 143b6309496b |
13 | 74469227141 |
14 | 36d1bd9b831 |
15 | 1b47be5250b |
hex | eb6aeb2963 |
1011111111011 has 2 divisors, whose sum is σ = 1011111111012. Its totient is φ = 1011111111010.
The previous prime is 1011111111007. The next prime is 1011111111037. The reversal of 1011111111011 is 1101111111101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1011111111011 - 22 = 1011111111007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011111110983 and 1011111111001.
It is not a weakly prime, because it can be changed into another prime (1011111111041) 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, 505555555505 + 505555555506.
It is an arithmetic number, because the mean of its divisors is an integer number (505555555506).
Almost surely, 21011111111011 is an apocalyptic number.
1011111111011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011111111011 is an equidigital number, since it uses as much as digits as its factorization.
1011111111011 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 11.
Adding to 1011111111011 its reverse (1101111111101), we get a palindrome (2112222222112).
The spelling of 1011111111011 in words is "one trillion, eleven billion, one hundred eleven million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •