Base | Representation |
---|---|
bin | 100111101110… |
… | …010110001001 |
3 | 201121001120022 |
4 | 213232112021 |
5 | 10131212244 |
6 | 1011110225 |
7 | 154340624 |
oct | 47562611 |
9 | 21531508 |
10 | 10413449 |
11 | 5972862 |
12 | 35a2375 |
13 | 2207b07 |
14 | 1550dbb |
15 | daa6ee |
hex | 9ee589 |
10413449 has 2 divisors, whose sum is σ = 10413450. Its totient is φ = 10413448.
The previous prime is 10413433. The next prime is 10413451. The reversal of 10413449 is 94431401.
10413449 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5382400 + 5031049 = 2320^2 + 2243^2 .
It is an emirp because it is prime and its reverse (94431401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10413449 - 24 = 10413433 is a prime.
Together with 10413451, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10413479) 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 as a sum of consecutive naturals, namely, 5206724 + 5206725.
It is an arithmetic number, because the mean of its divisors is an integer number (5206725).
Almost surely, 210413449 is an apocalyptic number.
It is an amenable number.
10413449 is a deficient number, since it is larger than the sum of its proper divisors (1).
10413449 is an equidigital number, since it uses as much as digits as its factorization.
10413449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 10413449 is about 3226.9876045625. The cubic root of 10413449 is about 218.3726267423.
The spelling of 10413449 in words is "ten million, four hundred thirteen thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •