Base | Representation |
---|---|
bin | 1110001101001101000111… |
… | …01100010000000011010001 |
3 | 11002121112000100011212212011 |
4 | 13012212203230100003101 |
5 | 13043314102104230342 |
6 | 150235251113302521 |
7 | 6403006253545345 |
oct | 706464354200321 |
9 | 132545010155764 |
10 | 31240043430097 |
11 | 9a549120a9927 |
12 | 3606643404a41 |
13 | 1457c00aa4398 |
14 | 7a0051b49625 |
15 | 39295a1c9717 |
hex | 1c69a3b100d1 |
31240043430097 has 2 divisors, whose sum is σ = 31240043430098. Its totient is φ = 31240043430096.
The previous prime is 31240043430083. The next prime is 31240043430131. The reversal of 31240043430097 is 79003434004213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29043864663696 + 2196178766401 = 5389236^2 + 1481951^2 .
It is a cyclic number.
It is not a de Polignac number, because 31240043430097 - 235 = 31205683691729 is a prime.
It is a super-3 number, since 3×312400434300973 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (31240043430697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15620021715048 + 15620021715049.
It is an arithmetic number, because the mean of its divisors is an integer number (15620021715049).
Almost surely, 231240043430097 is an apocalyptic number.
It is an amenable number.
31240043430097 is a deficient number, since it is larger than the sum of its proper divisors (1).
31240043430097 is an equidigital number, since it uses as much as digits as its factorization.
31240043430097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 40.
The spelling of 31240043430097 in words is "thirty-one trillion, two hundred forty billion, forty-three million, four hundred thirty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •