Base | Representation |
---|---|
bin | 100111101100… |
… | …101011011101 |
3 | 201120201012102 |
4 | 213230223131 |
5 | 10131002441 |
6 | 1011014445 |
7 | 154312001 |
oct | 47545335 |
9 | 21521172 |
10 | 10406621 |
11 | 5968715 |
12 | 359a425 |
13 | 2204984 |
14 | 154c701 |
15 | da869b |
hex | 9ecadd |
10406621 has 8 divisors (see below), whose sum is σ = 10817400. Its totient is φ = 9999360.
The previous prime is 10406611. The next prime is 10406629. The reversal of 10406621 is 12660401.
It is a happy number.
10406621 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1466521 + 8940100 = 1211^2 + 2990^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10406621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10406593 and 10406602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10406629) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6245 + ... + 7733.
It is an arithmetic number, because the mean of its divisors is an integer number (1352175).
Almost surely, 210406621 is an apocalyptic number.
It is an amenable number.
10406621 is a deficient number, since it is larger than the sum of its proper divisors (410779).
10406621 is a wasteful number, since it uses less digits than its factorization.
10406621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1759.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 10406621 is about 3225.9294784604. The cubic root of 10406621 is about 218.3248880184.
The spelling of 10406621 in words is "ten million, four hundred six thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •