Search a number
-
+
311120122109 is a prime number
BaseRepresentation
bin1001000011100000011…
…01000101000011111101
31002202001111101202112112
410201300031011003331
520044133222401414
6354532051543405
731322563255406
oct4416015050375
91082044352475
10311120122109
1110aa4421a665
12503695bab65
13234528c3914
14110b5d609ad
15815da79d3e
hex48703450fd

311120122109 has 2 divisors, whose sum is σ = 311120122110. Its totient is φ = 311120122108.

The previous prime is 311120122091. The next prime is 311120122129. The reversal of 311120122109 is 901221021113.

Together with previous prime (311120122091) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 255717319225 + 55402802884 = 505685^2 + 235378^2 .

It is a cyclic number.

It is not a de Polignac number, because 311120122109 - 232 = 306825154813 is a prime.

It is a super-2 number, since 2×3111201221092 (a number of 24 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (311120122129) 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, 155560061054 + 155560061055.

It is an arithmetic number, because the mean of its divisors is an integer number (155560061055).

Almost surely, 2311120122109 is an apocalyptic number.

It is an amenable number.

311120122109 is a deficient number, since it is larger than the sum of its proper divisors (1).

311120122109 is an equidigital number, since it uses as much as digits as its factorization.

311120122109 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 216, while the sum is 23.

The spelling of 311120122109 in words is "three hundred eleven billion, one hundred twenty million, one hundred twenty-two thousand, one hundred nine".