Base | Representation |
---|---|
bin | 1110001101010001001110… |
… | …11101000111001011100001 |
3 | 11002121201201101212012220201 |
4 | 13012220213131013023201 |
5 | 13043333114014212423 |
6 | 150240254322505201 |
7 | 6403115115543334 |
oct | 706504735071341 |
9 | 132551641765821 |
10 | 31242254054113 |
11 | 9a55846a25423 |
12 | 3606b5b805201 |
13 | 1458193a8562b |
14 | 7a01c159061b |
15 | 392a392e42ad |
hex | 1c6a277472e1 |
31242254054113 has 2 divisors, whose sum is σ = 31242254054114. Its totient is φ = 31242254054112.
The previous prime is 31242254054083. The next prime is 31242254054191. The reversal of 31242254054113 is 31145045224213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19723751146449 + 11518502907664 = 4441143^2 + 3393892^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31242254054113 is a prime.
It is not a weakly prime, because it can be changed into another prime (31242234054113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15621127027056 + 15621127027057.
It is an arithmetic number, because the mean of its divisors is an integer number (15621127027057).
Almost surely, 231242254054113 is an apocalyptic number.
It is an amenable number.
31242254054113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31242254054113 is an equidigital number, since it uses as much as digits as its factorization.
31242254054113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 31242254054113 its reverse (31145045224213), we get a palindrome (62387299278326).
The spelling of 31242254054113 in words is "thirty-one trillion, two hundred forty-two billion, two hundred fifty-four million, fifty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •