Base | Representation |
---|---|
bin | 101010001101… |
… | …010001001101 |
3 | 202211010111111 |
4 | 222031101031 |
5 | 10313030042 |
6 | 1033052021 |
7 | 163021501 |
oct | 52152115 |
9 | 22733444 |
10 | 11064397 |
11 | 6277933 |
12 | 3857011 |
13 | 23a51a6 |
14 | 1680301 |
15 | e88517 |
hex | a8d44d |
11064397 has 2 divisors, whose sum is σ = 11064398. Its totient is φ = 11064396.
The previous prime is 11064379. The next prime is 11064401. The reversal of 11064397 is 79346011.
It is a happy number.
Together with previous prime (11064379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8649481 + 2414916 = 2941^2 + 1554^2 .
It is a cyclic number.
It is not a de Polignac number, because 11064397 - 219 = 10540109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11064377) 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, 5532198 + 5532199.
It is an arithmetic number, because the mean of its divisors is an integer number (5532199).
Almost surely, 211064397 is an apocalyptic number.
It is an amenable number.
11064397 is a deficient number, since it is larger than the sum of its proper divisors (1).
11064397 is an equidigital number, since it uses as much as digits as its factorization.
11064397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 31.
The square root of 11064397 is about 3326.3188361911. The cubic root of 11064397 is about 222.8311577628.
The spelling of 11064397 in words is "eleven million, sixty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •