Base | Representation |
---|---|
bin | 100011010110111010110001… |
… | …1010101010000001110010101 |
3 | 1111210012120021000021002210212 |
4 | 1012231311203111100032111 |
5 | 311231114344112233414 |
6 | 3021245243324255205 |
7 | 122336646243233342 |
oct | 10655654325201625 |
9 | 1453176230232725 |
10 | 311013133321109 |
11 | 90109a24733a1a |
12 | 2aa705190a1505 |
13 | 10470549709b9b |
14 | 56b318a31d7c9 |
15 | 25e527300283e |
hex | 11add63550395 |
311013133321109 has 2 divisors, whose sum is σ = 311013133321110. Its totient is φ = 311013133321108.
The previous prime is 311013133321091. The next prime is 311013133321117. The reversal of 311013133321109 is 901123331310113.
Together with previous prime (311013133321091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 186817777696900 + 124195355624209 = 13668130^2 + 11144297^2 .
It is a cyclic number.
It is not a de Polignac number, because 311013133321109 - 212 = 311013133317013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311013133321129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155506566660554 + 155506566660555.
It is an arithmetic number, because the mean of its divisors is an integer number (155506566660555).
Almost surely, 2311013133321109 is an apocalyptic number.
It is an amenable number.
311013133321109 is a deficient number, since it is larger than the sum of its proper divisors (1).
311013133321109 is an equidigital number, since it uses as much as digits as its factorization.
311013133321109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4374, while the sum is 32.
The spelling of 311013133321109 in words is "three hundred eleven trillion, thirteen billion, one hundred thirty-three million, three hundred twenty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •