Search a number
-
+
311320101149 is a prime number
BaseRepresentation
bin1001000011111000001…
…11111100000100011101
31002202120102200202012122
410201330013330010131
520100040421214044
6355003554112325
731330542124601
oct4417407740435
91082512622178
10311320101149
111100370988a2
125040457b6a5
1323485171505
14110d4739501
1581713ccdee
hex487c1fc11d

311320101149 has 2 divisors, whose sum is σ = 311320101150. Its totient is φ = 311320101148.

The previous prime is 311320101137. The next prime is 311320101221. The reversal of 311320101149 is 941101023113.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 256484512249 + 54835588900 = 506443^2 + 234170^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-311320101149 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (311320101349) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155660050574 + 155660050575.

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

Almost surely, 2311320101149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 26.

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