Base | Representation |
---|---|
bin | 101011001101… |
… | …100001111001 |
3 | 210022111120002 |
4 | 223031201321 |
5 | 10344440414 |
6 | 1042442345 |
7 | 165166046 |
oct | 53154171 |
9 | 23274502 |
10 | 11327609 |
11 | 6437667 |
12 | 39633b5 |
13 | 2467c37 |
14 | 170c1cd |
15 | edb4de |
hex | acd879 |
11327609 has 2 divisors, whose sum is σ = 11327610. Its totient is φ = 11327608.
The previous prime is 11327599. The next prime is 11327621. The reversal of 11327609 is 90672311.
11327609 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9954025 + 1373584 = 3155^2 + 1172^2 .
It is a cyclic number.
It is not a de Polignac number, because 11327609 - 28 = 11327353 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is equal to p746714 and since 11327609 and 746714 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (11327669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5663804 + 5663805.
It is an arithmetic number, because the mean of its divisors is an integer number (5663805).
Almost surely, 211327609 is an apocalyptic number.
It is an amenable number.
11327609 is a deficient number, since it is larger than the sum of its proper divisors (1).
11327609 is an equidigital number, since it uses as much as digits as its factorization.
11327609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 29.
The square root of 11327609 is about 3365.6513485505. The cubic root of 11327609 is about 224.5843123250.
The spelling of 11327609 in words is "eleven million, three hundred twenty-seven thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •