Base | Representation |
---|---|
bin | 100011010111110001010110… |
… | …0011100010110000111101111 |
3 | 1111210121202202020021010220202 |
4 | 1012233202230130112013233 |
5 | 311240024400423042111 |
6 | 3021415144144104115 |
7 | 122351265320660405 |
oct | 10657425434260757 |
9 | 1453552666233822 |
10 | 311130324034031 |
11 | 901546a1848087 |
12 | 2aa8b18400503b |
13 | 1047b604894ab8 |
14 | 56b8b06505475 |
15 | 25e8331536b3b |
hex | 11af8ac7161ef |
311130324034031 has 2 divisors, whose sum is σ = 311130324034032. Its totient is φ = 311130324034030.
The previous prime is 311130324033961. The next prime is 311130324034081. The reversal of 311130324034031 is 130430423031113.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311130324034031 is a prime.
It is a super-2 number, since 2×3111303240340312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 311130324033985 and 311130324034003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311130324034081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155565162017015 + 155565162017016.
It is an arithmetic number, because the mean of its divisors is an integer number (155565162017016).
Almost surely, 2311130324034031 is an apocalyptic number.
311130324034031 is a deficient number, since it is larger than the sum of its proper divisors (1).
311130324034031 is an equidigital number, since it uses as much as digits as its factorization.
311130324034031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 311130324034031 its reverse (130430423031113), we get a palindrome (441560747065144).
The spelling of 311130324034031 in words is "three hundred eleven trillion, one hundred thirty billion, three hundred twenty-four million, thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •