Search a number
-
+
1311031110101 is a prime number
BaseRepresentation
bin10011000100111111100…
…010110010100111010101
311122100000000022220111112
4103010333202302213111
5132434442431010401
62442140202344405
7163501400365256
oct23047742624725
94570000286445
101311031110101
11466006979509
121921057bb105
13968255c511b
1447650636b2d
15241825ac3bb
hex1313f8b29d5

1311031110101 has 2 divisors, whose sum is σ = 1311031110102. Its totient is φ = 1311031110100.

The previous prime is 1311031110031. The next prime is 1311031110119. The reversal of 1311031110101 is 1010111301131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1242944035876 + 68087074225 = 1114874^2 + 260935^2 .

It is a cyclic number.

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

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 (1311031110121) by changing a digit.

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

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

Almost surely, 21311031110101 is an apocalyptic number.

It is an amenable number.

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

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

1311031110101 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 9, while the sum is 14.

Adding to 1311031110101 its reverse (1010111301131), we get a palindrome (2321142411232).

The spelling of 1311031110101 in words is "one trillion, three hundred eleven billion, thirty-one million, one hundred ten thousand, one hundred one".