Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …110011101110101100001 |
3 | 10220011120121221201102112 |
4 | 100000203232131311201 |
5 | 121011011404324134 |
6 | 2201214540525105 |
7 | 142323530210162 |
oct | 20004356356541 |
9 | 3804517851375 |
10 | 1100111011169 |
11 | 394610a93365 |
12 | 159260b50795 |
13 | 7c980aa5961 |
14 | 3b362123769 |
15 | 1d93a5cd1ce |
hex | 10023b9dd61 |
1100111011169 has 2 divisors, whose sum is σ = 1100111011170. Its totient is φ = 1100111011168.
The previous prime is 1100111011091. The next prime is 1100111011171. The reversal of 1100111011169 is 9611101110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1065137523025 + 34973488144 = 1032055^2 + 187012^2 .
It is an emirp because it is prime and its reverse (9611101110011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100111011169 is a prime.
It is a super-2 number, since 2×11001110111692 (a number of 25 digits) contains 22 as substring.
Together with 1100111011171, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1100111011199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550055505584 + 550055505585.
It is an arithmetic number, because the mean of its divisors is an integer number (550055505585).
Almost surely, 21100111011169 is an apocalyptic number.
It is an amenable number.
1100111011169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100111011169 is an equidigital number, since it uses as much as digits as its factorization.
1100111011169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 23.
The spelling of 1100111011169 in words is "one trillion, one hundred billion, one hundred eleven million, eleven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •