Base | Representation |
---|---|
bin | 10010101010011… |
… | …100000000000111 |
3 | 210211011212112012 |
4 | 102222130000013 |
5 | 1120124132011 |
6 | 51023044435 |
7 | 10521300434 |
oct | 2252340007 |
9 | 724155465 |
10 | 313114631 |
11 | 150821725 |
12 | 88a4071b |
13 | 4cb4023b |
14 | 2d828b8b |
15 | 1c74ea8b |
hex | 12a9c007 |
313114631 has 2 divisors, whose sum is σ = 313114632. Its totient is φ = 313114630.
The previous prime is 313114621. The next prime is 313114639. The reversal of 313114631 is 136411313.
It is a strong prime.
It is an emirp because it is prime and its reverse (136411313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313114631 - 26 = 313114567 is a prime.
It is a super-2 number, since 2×3131146312 = 196081544292532322, 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 = 313114597 and 313114606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313114639) 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, 156557315 + 156557316.
It is an arithmetic number, because the mean of its divisors is an integer number (156557316).
Almost surely, 2313114631 is an apocalyptic number.
313114631 is a deficient number, since it is larger than the sum of its proper divisors (1).
313114631 is an equidigital number, since it uses as much as digits as its factorization.
313114631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 23.
The square root of 313114631 is about 17695.0453799927. The cubic root of 313114631 is about 679.0490101799.
Adding to 313114631 its reverse (136411313), we get a palindrome (449525944).
The spelling of 313114631 in words is "three hundred thirteen million, one hundred fourteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •