Base | Representation |
---|---|
bin | 10010101100000… |
… | …100001001101111 |
3 | 210211222112201012 |
4 | 102230010021233 |
5 | 1120231304411 |
6 | 51040135435 |
7 | 10525025243 |
oct | 2254041157 |
9 | 724875635 |
10 | 313541231 |
11 | 150a93193 |
12 | 8900757b |
13 | 4cc5c473 |
14 | 2d8da423 |
15 | 1c7d618b |
hex | 12b0426f |
313541231 has 2 divisors, whose sum is σ = 313541232. Its totient is φ = 313541230.
The previous prime is 313541209. The next prime is 313541237. The reversal of 313541231 is 132145313.
It is a strong prime.
It is an emirp because it is prime and its reverse (132145313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313541231 - 214 = 313524847 is a prime.
It is a super-2 number, since 2×3135412312 = 196616207073990722, 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 = 313541197 and 313541206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313541237) 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, 156770615 + 156770616.
It is an arithmetic number, because the mean of its divisors is an integer number (156770616).
Almost surely, 2313541231 is an apocalyptic number.
313541231 is a deficient number, since it is larger than the sum of its proper divisors (1).
313541231 is an equidigital number, since it uses as much as digits as its factorization.
313541231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1080, while the sum is 23.
The square root of 313541231 is about 17707.0954986977. The cubic root of 313541231 is about 679.3572581507.
Adding to 313541231 its reverse (132145313), we get a palindrome (445686544).
The spelling of 313541231 in words is "three hundred thirteen million, five hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •