Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …111110011101101010111 |
3 | 10220020220100111222101211 |
4 | 100001121113303231113 |
5 | 121014332311303421 |
6 | 2201444131402251 |
7 | 142355036302162 |
oct | 20013127635527 |
9 | 3806810458354 |
10 | 1101011041111 |
11 | 394a33036163 |
12 | 159472453387 |
13 | 7ca953acb57 |
14 | 3b40988aad9 |
15 | 1d98e6139e1 |
hex | 100595f3b57 |
1101011041111 has 2 divisors, whose sum is σ = 1101011041112. Its totient is φ = 1101011041110.
The previous prime is 1101011041087. The next prime is 1101011041121. The reversal of 1101011041111 is 1111401101011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101011041111 - 25 = 1101011041079 is a prime.
It is a super-2 number, since 2×11010110411112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101011041091 and 1101011041100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101011041121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505520555 + 550505520556.
It is an arithmetic number, because the mean of its divisors is an integer number (550505520556).
Almost surely, 21101011041111 is an apocalyptic number.
1101011041111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101011041111 is an equidigital number, since it uses as much as digits as its factorization.
1101011041111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1101011041111 its reverse (1111401101011), we get a palindrome (2212412142122).
The spelling of 1101011041111 in words is "one trillion, one hundred one billion, eleven million, forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •