Search a number
-
+
131422310502913 is a prime number
BaseRepresentation
bin11101111000011100100100…
…001000100001001000000001
3122020022211221210011001122101
4131320130210020201020001
5114211210342442043123
61143302324224110401
736452643240412513
oct3570344410411001
9566284853131571
10131422310502913
1138969986119581
12128a6635a65401
1358440bc448571
142464c33893bb3
15102d8e121caad
hex778724221201

131422310502913 has 2 divisors, whose sum is σ = 131422310502914. Its totient is φ = 131422310502912.

The previous prime is 131422310502887. The next prime is 131422310502937. The reversal of 131422310502913 is 319205013224131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104589319979664 + 26832990523249 = 10226892^2 + 5180057^2 .

It is an emirp because it is prime and its reverse (319205013224131) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 131422310502913 - 25 = 131422310502881 is a prime.

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

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

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

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

Almost surely, 2131422310502913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 38880, while the sum is 37.

The spelling of 131422310502913 in words is "one hundred thirty-one trillion, four hundred twenty-two billion, three hundred ten million, five hundred two thousand, nine hundred thirteen".