Base | Representation |
---|---|
bin | 10100100001101100… |
… | …11000100100011101 |
3 | 1001110000021121010021 |
4 | 22100312120210131 |
5 | 140032122010414 |
6 | 5021303112141 |
7 | 540042250621 |
oct | 122066304435 |
9 | 31400247107 |
10 | 11020110109 |
11 | 4745623918 |
12 | 2176742651 |
13 | 1068148c18 |
14 | 767827181 |
15 | 447712c24 |
hex | 290d9891d |
11020110109 has 2 divisors, whose sum is σ = 11020110110. Its totient is φ = 11020110108.
The previous prime is 11020110097. The next prime is 11020110161. The reversal of 11020110109 is 90101102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10941787609 + 78322500 = 104603^2 + 8850^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11020110109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020110092 and 11020110101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020113109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510055054 + 5510055055.
It is an arithmetic number, because the mean of its divisors is an integer number (5510055055).
Almost surely, 211020110109 is an apocalyptic number.
It is an amenable number.
11020110109 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020110109 is an equidigital number, since it uses as much as digits as its factorization.
11020110109 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 16.
The spelling of 11020110109 in words is "eleven billion, twenty million, one hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •