Base | Representation |
---|---|
bin | 101010010011… |
… | …010001110001 |
3 | 202212101021001 |
4 | 222103101301 |
5 | 10314322014 |
6 | 1033402001 |
7 | 163153321 |
oct | 52232161 |
9 | 22771231 |
10 | 11089009 |
11 | 6294378 |
12 | 3869301 |
13 | 23b3459 |
14 | 1689281 |
15 | e90974 |
hex | a93471 |
11089009 has 2 divisors, whose sum is σ = 11089010. Its totient is φ = 11089008.
The previous prime is 11088997. The next prime is 11089037. The reversal of 11089009 is 90098011.
11089009 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (11089037) can be obtained adding 11089009 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10144225 + 944784 = 3185^2 + 972^2 .
It is a cyclic number.
It is not a de Polignac number, because 11089009 - 27 = 11088881 is a prime.
It is a super-2 number, since 2×110890092 = 245932241204162, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11089069) 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, 5544504 + 5544505.
It is an arithmetic number, because the mean of its divisors is an integer number (5544505).
Almost surely, 211089009 is an apocalyptic number.
It is an amenable number.
11089009 is a deficient number, since it is larger than the sum of its proper divisors (1).
11089009 is an equidigital number, since it uses as much as digits as its factorization.
11089009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 28.
The square root of 11089009 is about 3330.0163663261. The cubic root of 11089009 is about 222.9962596650.
The spelling of 11089009 in words is "eleven million, eighty-nine thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •