Base | Representation |
---|---|
bin | 10000000000100100011… |
… | …000110011111001111001 |
3 | 10220011121101211200100221 |
4 | 100000210120303321321 |
5 | 121011022230032414 |
6 | 2201220014500041 |
7 | 142324023442033 |
oct | 20004430637171 |
9 | 3804541750327 |
10 | 1100122111609 |
11 | 394617285284 |
12 | 159264804621 |
13 | 7c983191371 |
14 | 3b3637b2c53 |
15 | 1d93b572224 |
hex | 10024633e79 |
1100122111609 has 2 divisors, whose sum is σ = 1100122111610. Its totient is φ = 1100122111608.
The previous prime is 1100122111607. The next prime is 1100122111661. The reversal of 1100122111609 is 9061112210011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1020342414400 + 79779697209 = 1010120^2 + 282453^2 .
It is an emirp because it is prime and its reverse (9061112210011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1100122111609 - 21 = 1100122111607 is a prime.
Together with 1100122111607, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1100122111601) 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, 550061055804 + 550061055805.
It is an arithmetic number, because the mean of its divisors is an integer number (550061055805).
Almost surely, 21100122111609 is an apocalyptic number.
It is an amenable number.
1100122111609 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100122111609 is an equidigital number, since it uses as much as digits as its factorization.
1100122111609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 25.
The spelling of 1100122111609 in words is "one trillion, one hundred billion, one hundred twenty-two million, one hundred eleven thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •