Base | Representation |
---|---|
bin | 1110001111010001010100… |
… | …01111101001100001010001 |
3 | 11002212022012211202010202211 |
4 | 13013220222033221201101 |
5 | 13100444432201130022 |
6 | 150332030102512121 |
7 | 6411101162350666 |
oct | 707505217514121 |
9 | 132768184663684 |
10 | 31311020333137 |
11 | 9a81a24779686 |
12 | 3618351435641 |
13 | 146180272cc6c |
14 | 7a36663b9a6d |
15 | 394711457e77 |
hex | 1c7a2a3e9851 |
31311020333137 has 2 divisors, whose sum is σ = 31311020333138. Its totient is φ = 31311020333136.
The previous prime is 31311020333023. The next prime is 31311020333213. The reversal of 31311020333137 is 73133302011313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24537915187776 + 6773105145361 = 4953576^2 + 2602519^2 .
It is an emirp because it is prime and its reverse (73133302011313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31311020333137 - 235 = 31276660594769 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31311020333099 and 31311020333108.
It is not a weakly prime, because it can be changed into another prime (31311020343137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15655510166568 + 15655510166569.
It is an arithmetic number, because the mean of its divisors is an integer number (15655510166569).
Almost surely, 231311020333137 is an apocalyptic number.
It is an amenable number.
31311020333137 is a deficient number, since it is larger than the sum of its proper divisors (1).
31311020333137 is an equidigital number, since it uses as much as digits as its factorization.
31311020333137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10206, while the sum is 31.
The spelling of 31311020333137 in words is "thirty-one trillion, three hundred eleven billion, twenty million, three hundred thirty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •