Base | Representation |
---|---|
bin | 101000011101… |
… | …000010111001 |
3 | 201221202221202 |
4 | 220131002321 |
5 | 10203322404 |
6 | 1015143545 |
7 | 156065402 |
oct | 50350271 |
9 | 21852852 |
10 | 10604729 |
11 | 5a93543 |
12 | 3674bb5 |
13 | 2273bb5 |
14 | 15a09a9 |
15 | de721e |
hex | a1d0b9 |
10604729 has 2 divisors, whose sum is σ = 10604730. Its totient is φ = 10604728.
The previous prime is 10604687. The next prime is 10604731. The reversal of 10604729 is 92740601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10549504 + 55225 = 3248^2 + 235^2 .
It is an emirp because it is prime and its reverse (92740601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10604729 is a prime.
It is a super-2 number, since 2×106047292 = 224920554326882, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 10604731, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10601729) 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, 5302364 + 5302365.
It is an arithmetic number, because the mean of its divisors is an integer number (5302365).
Almost surely, 210604729 is an apocalyptic number.
It is an amenable number.
10604729 is a deficient number, since it is larger than the sum of its proper divisors (1).
10604729 is an equidigital number, since it uses as much as digits as its factorization.
10604729 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 29.
The square root of 10604729 is about 3256.4902886390. The cubic root of 10604729 is about 219.7015857636.
The spelling of 10604729 in words is "ten million, six hundred four thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •