Base | Representation |
---|---|
bin | 100111101100… |
… | …000010101101 |
3 | 201120120121211 |
4 | 213230002231 |
5 | 10130412023 |
6 | 1010554421 |
7 | 154301254 |
oct | 47540255 |
9 | 21516554 |
10 | 10404013 |
11 | 5966764 |
12 | 3598a11 |
13 | 2203729 |
14 | 154b79b |
15 | da7a0d |
hex | 9ec0ad |
10404013 has 2 divisors, whose sum is σ = 10404014. Its totient is φ = 10404012.
The previous prime is 10404007. The next prime is 10404019. The reversal of 10404013 is 31040401.
10404013 is digitally balanced in base 2, 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 (10404007) and next prime (10404019).
It can be written as a sum of positive squares in only one way, i.e., 9998244 + 405769 = 3162^2 + 637^2 .
It is a cyclic number.
It is not a de Polignac number, because 10404013 - 29 = 10403501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10403984 and 10404002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10404019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5202006 + 5202007.
It is an arithmetic number, because the mean of its divisors is an integer number (5202007).
Almost surely, 210404013 is an apocalyptic number.
It is an amenable number.
10404013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10404013 is an equidigital number, since it uses as much as digits as its factorization.
10404013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 10404013 is about 3225.5252285481. The cubic root of 10404013 is about 218.3066483842.
Adding to 10404013 its reverse (31040401), we get a palindrome (41444414).
The spelling of 10404013 in words is "ten million, four hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •