Base | Representation |
---|---|
bin | 100111101100… |
… | …000010110001 |
3 | 201120120121222 |
4 | 213230002301 |
5 | 10130412032 |
6 | 1010554425 |
7 | 154301261 |
oct | 47540261 |
9 | 21516558 |
10 | 10404017 |
11 | 5966768 |
12 | 3598a15 |
13 | 2203730 |
14 | 154b7a1 |
15 | da7a12 |
hex | 9ec0b1 |
10404017 has 16 divisors (see below), whose sum is σ = 11975040. Its totient is φ = 8954112.
The previous prime is 10404013. The next prime is 10404019. The reversal of 10404017 is 71040401.
It is a cyclic number.
It is not a de Polignac number, because 10404017 - 22 = 10404013 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10403986 and 10404004.
It is not an unprimeable number, because it can be changed into a prime (10404013) 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 in 15 ways as a sum of consecutive naturals, for example, 39428 + ... + 39690.
It is an arithmetic number, because the mean of its divisors is an integer number (748440).
Almost surely, 210404017 is an apocalyptic number.
10404017 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
10404017 is a deficient number, since it is larger than the sum of its proper divisors (1571023).
10404017 is a wasteful number, since it uses less digits than its factorization.
10404017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472.
The product of its (nonzero) digits is 112, while the sum is 17.
The square root of 10404017 is about 3225.5258486021. The cubic root of 10404017 is about 218.3066763614.
Adding to 10404017 its reverse (71040401), we get a palindrome (81444418).
The spelling of 10404017 in words is "ten million, four hundred four thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •