Base | Representation |
---|---|
bin | 1001000011101010000… |
… | …10110010100111111111 |
3 | 1002202021011011121002001 |
4 | 10201311002302213333 |
5 | 20044320013424411 |
6 | 354544112043131 |
7 | 31324600333366 |
oct | 4416502624777 |
9 | 1082234147061 |
10 | 311201311231 |
11 | 10aa86033208 |
12 | 503908334a7 |
13 | 2346667c315 |
14 | 110c2a567dd |
15 | 8165c65dc1 |
hex | 48750b29ff |
311201311231 has 2 divisors, whose sum is σ = 311201311232. Its totient is φ = 311201311230.
The previous prime is 311201311229. The next prime is 311201311307. The reversal of 311201311231 is 132113102113.
It is a weak prime.
It is an emirp because it is prime and its reverse (132113102113) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 311201311231 - 21 = 311201311229 is a prime.
It is a super-2 number, since 2×3112013112312 (a number of 24 digits) contains 22 as substring.
Together with 311201311229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 311201311199 and 311201311208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311201311831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155600655615 + 155600655616.
It is an arithmetic number, because the mean of its divisors is an integer number (155600655616).
Almost surely, 2311201311231 is an apocalyptic number.
311201311231 is a deficient number, since it is larger than the sum of its proper divisors (1).
311201311231 is an equidigital number, since it uses as much as digits as its factorization.
311201311231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 311201311231 its reverse (132113102113), we get a palindrome (443314413344).
The spelling of 311201311231 in words is "three hundred eleven billion, two hundred one million, three hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •