Base | Representation |
---|---|
bin | 101000100111… |
… | …000011001101 |
3 | 202000212011112 |
4 | 220213003031 |
5 | 10211130314 |
6 | 1020101405 |
7 | 156326024 |
oct | 50470315 |
9 | 22025145 |
10 | 10645709 |
11 | 6011308 |
12 | 3694865 |
13 | 2289749 |
14 | 15b18bb |
15 | e0443e |
hex | a270cd |
10645709 has 2 divisors, whose sum is σ = 10645710. Its totient is φ = 10645708.
The previous prime is 10645673. The next prime is 10645717. The reversal of 10645709 is 90754601.
It is a happy number.
10645709 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7856809 + 2788900 = 2803^2 + 1670^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10645709 is a prime.
It is a super-2 number, since 2×106457092 = 226662240225362, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10645729) 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, 5322854 + 5322855.
It is an arithmetic number, because the mean of its divisors is an integer number (5322855).
Almost surely, 210645709 is an apocalyptic number.
It is an amenable number.
10645709 is a deficient number, since it is larger than the sum of its proper divisors (1).
10645709 is an equidigital number, since it uses as much as digits as its factorization.
10645709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The square root of 10645709 is about 3262.7762718274. The cubic root of 10645709 is about 219.9842206313.
The spelling of 10645709 in words is "ten million, six hundred forty-five thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •