Search a number
-
+
311301318908009 is a prime number
BaseRepresentation
bin100011011001000000111110…
…0100010000001100001101001
31111211020010010011021202120102
41012302001330202001201221
5311300330100120024014
63022025503541435145
7122366530612266653
oct10662017442014151
91454203104252512
10311301318908009
1190210169a07851
122aab8345a0bab5
1310491785982ac1
1456c30c83536d3
1525ec9dd39e8de
hex11b207c881869

311301318908009 has 2 divisors, whose sum is σ = 311301318908010. Its totient is φ = 311301318908008.

The previous prime is 311301318907993. The next prime is 311301318908023. The reversal of 311301318908009 is 900809813103113.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 306213601081600 + 5087717826409 = 17498960^2 + 2255597^2 .

It is a cyclic number.

It is not a de Polignac number, because 311301318908009 - 24 = 311301318907993 is a prime.

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

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

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

Almost surely, 2311301318908009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 139968, while the sum is 47.

The spelling of 311301318908009 in words is "three hundred eleven trillion, three hundred one billion, three hundred eighteen million, nine hundred eight thousand, nine".