Base | Representation |
---|---|
bin | 10100101011010101… |
… | …11101000110101101 |
3 | 1001122122111020100012 |
4 | 22111222331012231 |
5 | 140213324000414 |
6 | 5033312543005 |
7 | 542043641543 |
oct | 122552750655 |
9 | 31578436305 |
10 | 11101000109 |
11 | 4787252761 |
12 | 2199851a65 |
13 | 107bb2b424 |
14 | 774481d93 |
15 | 44e89033e |
hex | 295abd1ad |
11101000109 has 2 divisors, whose sum is σ = 11101000110. Its totient is φ = 11101000108.
The previous prime is 11101000091. The next prime is 11101000159. The reversal of 11101000109 is 90100010111.
It is a happy number.
Together with previous prime (11101000091) 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., 10846597609 + 254402500 = 104147^2 + 15950^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101000109 - 212 = 11100996013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101000093 and 11101000102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101000159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550500054 + 5550500055.
It is an arithmetic number, because the mean of its divisors is an integer number (5550500055).
Almost surely, 211101000109 is an apocalyptic number.
It is an amenable number.
11101000109 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101000109 is an equidigital number, since it uses as much as digits as its factorization.
11101000109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 11101000109 in words is "eleven billion, one hundred one million, one hundred nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •