Base | Representation |
---|---|
bin | 101111101011… |
… | …110111011001 |
3 | 212112002101022 |
4 | 233223313121 |
5 | 11200003231 |
6 | 1123532225 |
7 | 211152302 |
oct | 57536731 |
9 | 25462338 |
10 | 12500441 |
11 | 7068848 |
12 | 422a075 |
13 | 2788a15 |
14 | 19357a9 |
15 | 116dc7b |
hex | bebdd9 |
12500441 has 2 divisors, whose sum is σ = 12500442. Its totient is φ = 12500440.
The previous prime is 12500437. The next prime is 12500443. The reversal of 12500441 is 14400521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12145225 + 355216 = 3485^2 + 596^2 .
It is a cyclic number.
It is not a de Polignac number, because 12500441 - 22 = 12500437 is a prime.
It is a super-2 number, since 2×125004412 = 312522050388962, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 12500443, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12500443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6250220 + 6250221.
It is an arithmetic number, because the mean of its divisors is an integer number (6250221).
Almost surely, 212500441 is an apocalyptic number.
It is an amenable number.
12500441 is a deficient number, since it is larger than the sum of its proper divisors (1).
12500441 is an equidigital number, since it uses as much as digits as its factorization.
12500441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 160, while the sum is 17.
The square root of 12500441 is about 3535.5962722008. The cubic root of 12500441 is about 232.0821709028.
Adding to 12500441 its reverse (14400521), we get a palindrome (26900962).
The spelling of 12500441 in words is "twelve million, five hundred thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •