Search a number
-
+
1311310329991 is a prime number
BaseRepresentation
bin10011000101010000001…
…011111011100010000111
311122100201110201202011221
4103011100023323202013
5132441030421024431
62442224015141211
7163511330616364
oct23052013734207
94570643652157
101311310329991
1146613a54a552
12192183214807
139686b3c86ac
144767975b46b
152419bd64111
hex131502fb887

1311310329991 has 2 divisors, whose sum is σ = 1311310329992. Its totient is φ = 1311310329990.

The previous prime is 1311310329929. The next prime is 1311310330049. The reversal of 1311310329991 is 1999230131131.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1311310329991 - 27 = 1311310329863 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21311310329991 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 39366, while the sum is 43.

The spelling of 1311310329991 in words is "one trillion, three hundred eleven billion, three hundred ten million, three hundred twenty-nine thousand, nine hundred ninety-one".