Search a number
-
+
1311034552031 is a prime number
BaseRepresentation
bin10011000100111111101…
…111111010111011011111
311122100000020210202221102
4103010333233322323133
5132434444321131111
62442140404223315
7163501441552121
oct23047757727337
94570006722842
101311034552031
1146600890a486
1219210699ab3b
139682622b979
1447650c91211
1524182a3c13b
hex1313fbfaedf

1311034552031 has 2 divisors, whose sum is σ = 1311034552032. Its totient is φ = 1311034552030.

The previous prime is 1311034551997. The next prime is 1311034552067. The reversal of 1311034552031 is 1302554301131.

It is a weak prime.

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a junction number, because it is equal to n+sod(n) for n = 1311034551985 and 1311034552003.

It is a congruent number.

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

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

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

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

Almost surely, 21311034552031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 29.

Adding to 1311034552031 its reverse (1302554301131), we get a palindrome (2613588853162).

The spelling of 1311034552031 in words is "one trillion, three hundred eleven billion, thirty-four million, five hundred fifty-two thousand, thirty-one".