Base | Representation |
---|---|
bin | 1110001100011011010111… |
… | …00000100000000100100001 |
3 | 11002111222001201001221220022 |
4 | 13012031223200200010201 |
5 | 13042344400220201423 |
6 | 150215112321523225 |
7 | 6401042304043022 |
oct | 706155340400441 |
9 | 132458051057808 |
10 | 31213331022113 |
11 | 9a445546a5399 |
12 | 36014294a3515 |
13 | 1455534868a06 |
14 | 79ca3a1aac49 |
15 | 391de5001dc8 |
hex | 1c636b820121 |
31213331022113 has 2 divisors, whose sum is σ = 31213331022114. Its totient is φ = 31213331022112.
The previous prime is 31213331022077. The next prime is 31213331022127. The reversal of 31213331022113 is 31122013331213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28278060914944 + 2935270107169 = 5317712^2 + 1713263^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31213331022113 is a prime.
It is not a weakly prime, because it can be changed into another prime (31213331025113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15606665511056 + 15606665511057.
It is an arithmetic number, because the mean of its divisors is an integer number (15606665511057).
Almost surely, 231213331022113 is an apocalyptic number.
It is an amenable number.
31213331022113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31213331022113 is an equidigital number, since it uses as much as digits as its factorization.
31213331022113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 31213331022113 its reverse (31122013331213), we get a palindrome (62335344353326).
The spelling of 31213331022113 in words is "thirty-one trillion, two hundred thirteen billion, three hundred thirty-one million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •