Base | Representation |
---|---|
bin | 101000101001… |
… | …101011101101 |
3 | 202001101221221 |
4 | 220221223231 |
5 | 10212001433 |
6 | 1020223341 |
7 | 156402331 |
oct | 50515355 |
9 | 22041857 |
10 | 10656493 |
11 | 6019421 |
12 | 369ab51 |
13 | 2291623 |
14 | 15b57c1 |
15 | e0772d |
hex | a29aed |
10656493 has 4 divisors (see below), whose sum is σ = 10663488. Its totient is φ = 10649500.
The previous prime is 10656479. The next prime is 10656509. The reversal of 10656493 is 39465601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10656493 is a prime.
It is a super-2 number, since 2×106564932 = 227121686118098, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10656413) 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 in 3 ways as a sum of consecutive naturals, for example, 133 + ... + 4618.
It is an arithmetic number, because the mean of its divisors is an integer number (2665872).
Almost surely, 210656493 is an apocalyptic number.
It is an amenable number.
10656493 is a deficient number, since it is larger than the sum of its proper divisors (6995).
10656493 is an equidigital number, since it uses as much as digits as its factorization.
10656493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6994.
The product of its (nonzero) digits is 19440, while the sum is 34.
The square root of 10656493 is about 3264.4284338916. The cubic root of 10656493 is about 220.0584761911.
The spelling of 10656493 in words is "ten million, six hundred fifty-six thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •