Base | Representation |
---|---|
bin | 100011100111101000011011… |
… | …1001100011010110101011011 |
3 | 1112002100011101120001122012212 |
4 | 1013033100313030122311123 |
5 | 312031233242234424011 |
6 | 3030204415150025335 |
7 | 122664625560420422 |
oct | 10717206714326533 |
9 | 1462304346048185 |
10 | 313310200311131 |
11 | 90915123106211 |
12 | 2b1817481a824b |
13 | 105a904324209a |
14 | 575241a5862b9 |
15 | 2634db5e2e08b |
hex | 11cf43731ad5b |
313310200311131 has 2 divisors, whose sum is σ = 313310200311132. Its totient is φ = 313310200311130.
The previous prime is 313310200311067. The next prime is 313310200311179. The reversal of 313310200311131 is 131113002013313.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 313310200311131 - 26 = 313310200311067 is a prime.
It is a super-2 number, since 2×3133102003111312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 313310200311097 and 313310200311106.
It is not a weakly prime, because it can be changed into another prime (313310200317131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156655100155565 + 156655100155566.
It is an arithmetic number, because the mean of its divisors is an integer number (156655100155566).
Almost surely, 2313310200311131 is an apocalyptic number.
313310200311131 is a deficient number, since it is larger than the sum of its proper divisors (1).
313310200311131 is an equidigital number, since it uses as much as digits as its factorization.
313310200311131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 313310200311131 its reverse (131113002013313), we get a palindrome (444423202324444).
The spelling of 313310200311131 in words is "three hundred thirteen trillion, three hundred ten billion, two hundred million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •