Base | Representation |
---|---|
bin | 1110001100010111000100… |
… | …11011000101000011101001 |
3 | 11002111202010102101221021022 |
4 | 13012023202123011003221 |
5 | 13042330142431402103 |
6 | 150214052203022225 |
7 | 6400631306156231 |
oct | 706134233050351 |
9 | 132452112357238 |
10 | 31211031122153 |
11 | 9a43584442523 |
12 | 3600aa720a975 |
13 | 145525922a26c |
14 | 79c89c966cc1 |
15 | 391d0d150138 |
hex | 1c62e26c50e9 |
31211031122153 has 2 divisors, whose sum is σ = 31211031122154. Its totient is φ = 31211031122152.
The previous prime is 31211031122113. The next prime is 31211031122177. The reversal of 31211031122153 is 35122113011213.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31165780047424 + 45251074729 = 5582632^2 + 212723^2 .
It is an emirp because it is prime and its reverse (35122113011213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31211031122153 - 210 = 31211031121129 is a prime.
It is not a weakly prime, because it can be changed into another prime (31211031122113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15605515561076 + 15605515561077.
It is an arithmetic number, because the mean of its divisors is an integer number (15605515561077).
Almost surely, 231211031122153 is an apocalyptic number.
It is an amenable number.
31211031122153 is a deficient number, since it is larger than the sum of its proper divisors (1).
31211031122153 is an equidigital number, since it uses as much as digits as its factorization.
31211031122153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 31211031122153 its reverse (35122113011213), we get a palindrome (66333144133366).
The spelling of 31211031122153 in words is "thirty-one trillion, two hundred eleven billion, thirty-one million, one hundred twenty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •