Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …101101110110100000011 |
3 | 10220020212120202120221121 |
4 | 100001120231232310003 |
5 | 121014322000323021 |
6 | 2201443055133111 |
7 | 142354543452355 |
oct | 20013055566403 |
9 | 3806776676847 |
10 | 1101000011011 |
11 | 394a2789207a |
12 | 15946a814197 |
13 | 7ca9301a474 |
14 | 3b4082190d5 |
15 | 1d98d685741 |
hex | 10058b6ed03 |
1101000011011 has 2 divisors, whose sum is σ = 1101000011012. Its totient is φ = 1101000011010.
The previous prime is 1101000010937. The next prime is 1101000011063. The reversal of 1101000011011 is 1101100001011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101000011011 - 221 = 1100997913859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101000010985 and 1101000011003.
It is not a weakly prime, because it can be changed into another prime (1101000011611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550500005505 + 550500005506.
It is an arithmetic number, because the mean of its divisors is an integer number (550500005506).
Almost surely, 21101000011011 is an apocalyptic number.
1101000011011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101000011011 is an equidigital number, since it uses as much as digits as its factorization.
1101000011011 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 1101000011011 its reverse (1101100001011), we get a palindrome (2202100012022).
The spelling of 1101000011011 in words is "one trillion, one hundred one billion, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •