Base | Representation |
---|---|
bin | 101010000010… |
… | …011101001101 |
3 | 202201212202012 |
4 | 222002131031 |
5 | 10310120414 |
6 | 1032111005 |
7 | 162445412 |
oct | 52023515 |
9 | 22655665 |
10 | 11020109 |
11 | 6247631 |
12 | 3835465 |
13 | 238ac99 |
14 | 166c109 |
15 | e7a33e |
hex | a8274d |
11020109 has 2 divisors, whose sum is σ = 11020110. Its totient is φ = 11020108.
The previous prime is 11020091. The next prime is 11020129. The reversal of 11020109 is 90102011.
Together with previous prime (11020091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10956100 + 64009 = 3310^2 + 253^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11020109 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11020093 and 11020102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510054 + 5510055.
It is an arithmetic number, because the mean of its divisors is an integer number (5510055).
Almost surely, 211020109 is an apocalyptic number.
It is an amenable number.
11020109 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020109 is an equidigital number, since it uses as much as digits as its factorization.
11020109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 11020109 is about 3319.6549519491. The cubic root of 11020109 is about 222.5334478185.
The spelling of 11020109 in words is "eleven million, twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •