Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …110111001101101100111 |
3 | 10220011121100220020210222 |
4 | 100000210112321231213 |
5 | 121011022113023421 |
6 | 2201220000034555 |
7 | 142324016255615 |
oct | 20004426715547 |
9 | 3804540806728 |
10 | 1100121611111 |
11 | 394616a73246 |
12 | 159264602a5b |
13 | 7c983047603 |
14 | 3b3636c26b5 |
15 | 1d93b4c3cab |
hex | 100245b9b67 |
1100121611111 has 2 divisors, whose sum is σ = 1100121611112. Its totient is φ = 1100121611110.
The previous prime is 1100121611047. The next prime is 1100121611119. The reversal of 1100121611111 is 1111161210011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100121611111 - 26 = 1100121611047 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1100121611111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100121611119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550060805555 + 550060805556.
It is an arithmetic number, because the mean of its divisors is an integer number (550060805556).
Almost surely, 21100121611111 is an apocalyptic number.
1100121611111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100121611111 is an equidigital number, since it uses as much as digits as its factorization.
1100121611111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 17.
Adding to 1100121611111 its reverse (1111161210011), we get a palindrome (2211282821122).
The spelling of 1100121611111 in words is "one trillion, one hundred billion, one hundred twenty-one million, six hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •