Base | Representation |
---|---|
bin | 110011101100… |
… | …001101001101 |
3 | 221111102200011 |
4 | 303230031031 |
5 | 11432103123 |
6 | 1202233221 |
7 | 223114402 |
oct | 63541515 |
9 | 27442604 |
10 | 13550413 |
11 | 7715698 |
12 | 4655811 |
13 | 2a658c6 |
14 | 1b2a2a9 |
15 | 12c9e0d |
hex | cec34d |
13550413 has 2 divisors, whose sum is σ = 13550414. Its totient is φ = 13550412.
The previous prime is 13550347. The next prime is 13550417. The reversal of 13550413 is 31405531.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10771524 + 2778889 = 3282^2 + 1667^2 .
It is an emirp because it is prime and its reverse (31405531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13550413 - 221 = 11453261 is a prime.
It is a super-2 number, since 2×135504132 = 367227384941138, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13550417) 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, 6775206 + 6775207.
It is an arithmetic number, because the mean of its divisors is an integer number (6775207).
Almost surely, 213550413 is an apocalyptic number.
It is an amenable number.
13550413 is a deficient number, since it is larger than the sum of its proper divisors (1).
13550413 is an equidigital number, since it uses as much as digits as its factorization.
13550413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 13550413 is about 3681.0885618252. The cubic root of 13550413 is about 238.4061809145.
Adding to 13550413 its reverse (31405531), we get a palindrome (44955944).
The spelling of 13550413 in words is "thirteen million, five hundred fifty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •