Base | Representation |
---|---|
bin | 101000011101… |
… | …000110011001 |
3 | 201221210021001 |
4 | 220131012121 |
5 | 10203324303 |
6 | 1015145001 |
7 | 156066142 |
oct | 50350631 |
9 | 21853231 |
10 | 10604953 |
11 | 5a93727 |
12 | 3675161 |
13 | 2274028 |
14 | 15a0ac9 |
15 | de731d |
hex | a1d199 |
10604953 has 2 divisors, whose sum is σ = 10604954. Its totient is φ = 10604952.
The previous prime is 10604947. The next prime is 10604959. The reversal of 10604953 is 35940601.
10604953 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (10604947) and next prime (10604959).
It can be written as a sum of positive squares in only one way, i.e., 10259209 + 345744 = 3203^2 + 588^2 .
It is a cyclic number.
It is not a de Polignac number, because 10604953 - 25 = 10604921 is a prime.
It is a super-2 number, since 2×106049532 = 224930056264418, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10604959) 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, 5302476 + 5302477.
It is an arithmetic number, because the mean of its divisors is an integer number (5302477).
Almost surely, 210604953 is an apocalyptic number.
It is an amenable number.
10604953 is a deficient number, since it is larger than the sum of its proper divisors (1).
10604953 is an equidigital number, since it uses as much as digits as its factorization.
10604953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 10604953 is about 3256.5246813129. The cubic root of 10604953 is about 219.7031326461.
The spelling of 10604953 in words is "ten million, six hundred four thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •