Base | Representation |
---|---|
bin | 110011001011… |
… | …000011100111 |
3 | 221020112102012 |
4 | 303023003213 |
5 | 11413232011 |
6 | 1155304435 |
7 | 222010466 |
oct | 63130347 |
9 | 27215365 |
10 | 13414631 |
11 | 763267a |
12 | 45ab11b |
13 | 2a18b69 |
14 | 1ad29dd |
15 | 129ea8b |
hex | ccb0e7 |
13414631 has 2 divisors, whose sum is σ = 13414632. Its totient is φ = 13414630.
The previous prime is 13414613. The next prime is 13414637. The reversal of 13414631 is 13641431.
Together with previous prime (13414613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (13641431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13414631 - 214 = 13398247 is a prime.
It is a super-2 number, since 2×134146312 = 359904649732322, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13414597 and 13414606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13414637) 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, 6707315 + 6707316.
It is an arithmetic number, because the mean of its divisors is an integer number (6707316).
Almost surely, 213414631 is an apocalyptic number.
13414631 is a deficient number, since it is larger than the sum of its proper divisors (1).
13414631 is an equidigital number, since it uses as much as digits as its factorization.
13414631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864, while the sum is 23.
The square root of 13414631 is about 3662.5989406431. The cubic root of 13414631 is about 237.6071892888.
The spelling of 13414631 in words is "thirteen million, four hundred fourteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •