Base | Representation |
---|---|
bin | 100011011010011111011010… |
… | …0100011001110111100101001 |
3 | 1111211221111120212111001101122 |
4 | 1012310332310203032330221 |
5 | 311312140420241242022 |
6 | 3022303003532225025 |
7 | 122420300353033211 |
oct | 10664766443167451 |
9 | 1454844525431348 |
10 | 311504122212137 |
11 | 9028917a102918 |
12 | 2ab2b70430b175 |
13 | 104a79359b80ca |
14 | 56ccc46879241 |
15 | 2602e0c9b2742 |
hex | 11b4fb48cef29 |
311504122212137 has 2 divisors, whose sum is σ = 311504122212138. Its totient is φ = 311504122212136.
The previous prime is 311504122212121. The next prime is 311504122212169. The reversal of 311504122212137 is 731212221405113.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 184297214023321 + 127206908188816 = 13575611^2 + 11278604^2 .
It is a cyclic number.
It is not a de Polignac number, because 311504122212137 - 24 = 311504122212121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 311504122212097 and 311504122212106.
It is not a weakly prime, because it can be changed into another prime (311504122212187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155752061106068 + 155752061106069.
It is an arithmetic number, because the mean of its divisors is an integer number (155752061106069).
Almost surely, 2311504122212137 is an apocalyptic number.
It is an amenable number.
311504122212137 is a deficient number, since it is larger than the sum of its proper divisors (1).
311504122212137 is an equidigital number, since it uses as much as digits as its factorization.
311504122212137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 35.
The spelling of 311504122212137 in words is "three hundred eleven trillion, five hundred four billion, one hundred twenty-two million, two hundred twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •