Base | Representation |
---|---|
bin | 1110001110111110101101… |
… | …11101011101101000111001 |
3 | 11002211100102211001021011102 |
4 | 13013133112331131220321 |
5 | 13100314003434403421 |
6 | 150323255054141145 |
7 | 6410265531433262 |
oct | 707372675355071 |
9 | 132740384037142 |
10 | 31301033122361 |
11 | 9a7876a1aa382 |
12 | 36164247b17b5 |
13 | 14608a059caa2 |
14 | 7a2d99c25969 |
15 | 39432977460b |
hex | 1c77d6f5da39 |
31301033122361 has 2 divisors, whose sum is σ = 31301033122362. Its totient is φ = 31301033122360.
The previous prime is 31301033122351. The next prime is 31301033122369. The reversal of 31301033122361 is 16322133010313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16801235342761 + 14499797779600 = 4098931^2 + 3807860^2 .
It is a cyclic number.
It is not a de Polignac number, because 31301033122361 - 242 = 26902986611257 is a prime.
It is not a weakly prime, because it can be changed into another prime (31301033122369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15650516561180 + 15650516561181.
It is an arithmetic number, because the mean of its divisors is an integer number (15650516561181).
Almost surely, 231301033122361 is an apocalyptic number.
It is an amenable number.
31301033122361 is a deficient number, since it is larger than the sum of its proper divisors (1).
31301033122361 is an equidigital number, since it uses as much as digits as its factorization.
31301033122361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 31301033122361 its reverse (16322133010313), we get a palindrome (47623166132674).
The spelling of 31301033122361 in words is "thirty-one trillion, three hundred one billion, thirty-three million, one hundred twenty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •