Base | Representation |
---|---|
bin | 1001000111010000001… |
… | …01001100101111001001 |
3 | 1002221020122211022112222 |
4 | 10203220011030233021 |
5 | 20112243104303223 |
6 | 355503414543425 |
7 | 31423454216015 |
oct | 4435005145711 |
9 | 1087218738488 |
10 | 313131322313 |
11 | 110886517097 |
12 | 5082b067b75 |
13 | 236b348cc04 |
14 | 112270d3545 |
15 | 822a4010c8 |
hex | 48e814cbc9 |
313131322313 has 2 divisors, whose sum is σ = 313131322314. Its totient is φ = 313131322312.
The previous prime is 313131322303. The next prime is 313131322319. The reversal of 313131322313 is 313223131313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 312494416144 + 636906169 = 559012^2 + 25237^2 .
It is an emirp because it is prime and its reverse (313223131313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313131322313 - 212 = 313131318217 is a prime.
It is not a weakly prime, because it can be changed into another prime (313131322319) 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, 156565661156 + 156565661157.
It is an arithmetic number, because the mean of its divisors is an integer number (156565661157).
Almost surely, 2313131322313 is an apocalyptic number.
It is an amenable number.
313131322313 is a deficient number, since it is larger than the sum of its proper divisors (1).
313131322313 is an equidigital number, since it uses as much as digits as its factorization.
313131322313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2916, while the sum is 26.
Adding to 313131322313 its reverse (313223131313), we get a palindrome (626354453626).
The spelling of 313131322313 in words is "three hundred thirteen billion, one hundred thirty-one million, three hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •