Base | Representation |
---|---|
bin | 110011001010… |
… | …100010010101 |
3 | 221020102111022 |
4 | 303022202111 |
5 | 11413200001 |
6 | 1155250525 |
7 | 222001334 |
oct | 63124225 |
9 | 27212438 |
10 | 13412501 |
11 | 7631013 |
12 | 45a9a45 |
13 | 2a17bbb |
14 | 1ad1d1b |
15 | 129e11b |
hex | cca895 |
13412501 has 2 divisors, whose sum is σ = 13412502. Its totient is φ = 13412500.
The previous prime is 13412489. The next prime is 13412513. The reversal of 13412501 is 10521431.
It is a balanced prime because it is at equal distance from previous prime (13412489) and next prime (13412513).
It can be written as a sum of positive squares in only one way, i.e., 10176100 + 3236401 = 3190^2 + 1799^2 .
It is a cyclic number.
It is not a de Polignac number, because 13412501 - 222 = 9218197 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13412501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13412521) 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 as a sum of consecutive naturals, namely, 6706250 + 6706251.
It is an arithmetic number, because the mean of its divisors is an integer number (6706251).
Almost surely, 213412501 is an apocalyptic number.
It is an amenable number.
13412501 is a deficient number, since it is larger than the sum of its proper divisors (1).
13412501 is an equidigital number, since it uses as much as digits as its factorization.
13412501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 13412501 is about 3662.3081519719. The cubic root of 13412501 is about 237.5946127197.
Adding to 13412501 its reverse (10521431), we get a palindrome (23933932).
The spelling of 13412501 in words is "thirteen million, four hundred twelve thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •