Base | Representation |
---|---|
bin | 100111101100… |
… | …000011001001 |
3 | 201120120122212 |
4 | 213230003021 |
5 | 10130412131 |
6 | 1010554505 |
7 | 154301324 |
oct | 47540311 |
9 | 21516585 |
10 | 10404041 |
11 | 596678a |
12 | 3598a35 |
13 | 220374b |
14 | 154b7bb |
15 | da7a2b |
hex | 9ec0c9 |
10404041 has 4 divisors (see below), whose sum is σ = 10417092. Its totient is φ = 10390992.
The previous prime is 10404019. The next prime is 10404049. The reversal of 10404041 is 14040401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14040401 = 2969 ⋅4729.
It can be written as a sum of positive squares in 2 ways, for example, as 3534400 + 6869641 = 1880^2 + 2621^2 .
It is a cyclic number.
It is not a de Polignac number, because 10404041 - 210 = 10403017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10404049) 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 3 ways as a sum of consecutive naturals, for example, 5246 + ... + 6951.
It is an arithmetic number, because the mean of its divisors is an integer number (2604273).
Almost surely, 210404041 is an apocalyptic number.
It is an amenable number.
10404041 is a deficient number, since it is larger than the sum of its proper divisors (13051).
10404041 is an equidigital number, since it uses as much as digits as its factorization.
10404041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13050.
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 10404041 is about 3225.5295689235. The cubic root of 10404041 is about 218.3068442247.
Adding to 10404041 its reverse (14040401), we get a palindrome (24444442).
The spelling of 10404041 in words is "ten million, four hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •