Base | Representation |
---|---|
bin | 1110000111001010001011… |
… | …11111101011000101001101 |
3 | 11001212122211020210100011112 |
4 | 13003211011333223011031 |
5 | 13031413134114024122 |
6 | 150000014154101405 |
7 | 6352003434366521 |
oct | 703450577530515 |
9 | 131778736710145 |
10 | 31032313033037 |
11 | 9984803772a28 |
12 | 359232aa1a865 |
13 | 1441447059284 |
14 | 793d870ddd81 |
15 | 38c34d2622e2 |
hex | 1c3945feb14d |
31032313033037 has 2 divisors, whose sum is σ = 31032313033038. Its totient is φ = 31032313033036.
The previous prime is 31032313032977. The next prime is 31032313033039. The reversal of 31032313033037 is 73033031323013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18666020335561 + 12366292697476 = 4320419^2 + 3516574^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31032313033037 is a prime.
Together with 31032313033039, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 31032313032994 and 31032313033012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31032313033039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15516156516518 + 15516156516519.
It is an arithmetic number, because the mean of its divisors is an integer number (15516156516519).
Almost surely, 231032313033037 is an apocalyptic number.
It is an amenable number.
31032313033037 is a deficient number, since it is larger than the sum of its proper divisors (1).
31032313033037 is an equidigital number, since it uses as much as digits as its factorization.
31032313033037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30618, while the sum is 32.
The spelling of 31032313033037 in words is "thirty-one trillion, thirty-two billion, three hundred thirteen million, thirty-three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •