Base | Representation |
---|---|
bin | 10011000101010000010… |
… | …110111010101111011011 |
3 | 11122100201200011002021012 |
4 | 103011100112322233123 |
5 | 132441032140212311 |
6 | 2442224201004135 |
7 | 163511364244025 |
oct | 23052026725733 |
9 | 4570650132235 |
10 | 1311313210331 |
11 | 4661411375a3 |
12 | 19218418364b |
13 | 9686bb96737 |
14 | 47679cab015 |
15 | 2419c23278b |
hex | 131505babdb |
1311313210331 has 2 divisors, whose sum is σ = 1311313210332. Its totient is φ = 1311313210330.
The previous prime is 1311313210327. The next prime is 1311313210367. The reversal of 1311313210331 is 1330123131131.
It is a weak prime.
It is an emirp because it is prime and its reverse (1330123131131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1311313210331 - 22 = 1311313210327 is a prime.
It is a super-2 number, since 2×13113132103312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1311313210297 and 1311313210306.
It is not a weakly prime, because it can be changed into another prime (1311313210301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655656605165 + 655656605166.
It is an arithmetic number, because the mean of its divisors is an integer number (655656605166).
Almost surely, 21311313210331 is an apocalyptic number.
1311313210331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311313210331 is an equidigital number, since it uses as much as digits as its factorization.
1311313210331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1311313210331 its reverse (1330123131131), we get a palindrome (2641436341462).
The spelling of 1311313210331 in words is "one trillion, three hundred eleven billion, three hundred thirteen million, two hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •