Search a number
-
+
311441110431001 is a prime number
BaseRepresentation
bin100011011010000010000100…
…0110000010111010100011001
31111211201110221110200220121221
41012310010020300113110121
5311310122343232243001
63022214023155132041
7122412610022524405
oct10664041060272431
91454643843626557
10311441110431001
1190264484649041
122ab1b4598a4021
13104a1a032b0205
1456c9b89dd4105
152601470b401a1
hex11b4108c17519

311441110431001 has 2 divisors, whose sum is σ = 311441110431002. Its totient is φ = 311441110431000.

The previous prime is 311441110430903. The next prime is 311441110431013. The reversal of 311441110431001 is 100134011144113.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 195813004622400 + 115628105808601 = 13993320^2 + 10753051^2 .

It is a cyclic number.

It is not a de Polignac number, because 311441110431001 - 27 = 311441110430873 is a prime.

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

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

Almost surely, 2311441110431001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 576, while the sum is 25.

Adding to 311441110431001 its reverse (100134011144113), we get a palindrome (411575121575114).

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