Base | Representation |
---|---|
bin | 100011010001111100110100… |
… | …0000001000011100000000011 |
3 | 1111200210021210000200201011021 |
4 | 1012203321220001003200003 |
5 | 311133422434400042011 |
6 | 3020003435520130311 |
7 | 122236424300562553 |
oct | 10643715001034003 |
9 | 1450707700621137 |
10 | 310330312112131 |
11 | 8a976389990283 |
12 | 2a980115766997 |
13 | 1042103b302b5c |
14 | 568c0d2759163 |
15 | 25d260c18c471 |
hex | 11a3e68043803 |
310330312112131 has 2 divisors, whose sum is σ = 310330312112132. Its totient is φ = 310330312112130.
The previous prime is 310330312112081. The next prime is 310330312112137. The reversal of 310330312112131 is 131211213033013.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 310330312112131 - 221 = 310330310014979 is a prime.
It is a super-2 number, since 2×3103303121121312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 310330312112096 and 310330312112105.
It is not a weakly prime, because it can be changed into another prime (310330312112137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155165156056065 + 155165156056066.
It is an arithmetic number, because the mean of its divisors is an integer number (155165156056066).
Almost surely, 2310330312112131 is an apocalyptic number.
310330312112131 is a deficient number, since it is larger than the sum of its proper divisors (1).
310330312112131 is an equidigital number, since it uses as much as digits as its factorization.
310330312112131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 310330312112131 its reverse (131211213033013), we get a palindrome (441541525145144).
The spelling of 310330312112131 in words is "three hundred ten trillion, three hundred thirty billion, three hundred twelve million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •