Search a number
-
+
131320303210171 is a prime number
BaseRepresentation
bin11101110110111101100100…
…000001100100111010111011
3122012222002122201102200102001
4131312331210001210322323
5114203022440110211141
61143143414153521431
736442402350626545
oct3566754401447273
9565862581380361
10131320303210171
113892a69a715759
121288a907a13277
1358375b3b0a24a
14245dd17dda695
15102ae20b7ea31
hex776f64064ebb

131320303210171 has 2 divisors, whose sum is σ = 131320303210172. Its totient is φ = 131320303210170.

The previous prime is 131320303210157. The next prime is 131320303210289. The reversal of 131320303210171 is 171012303023131.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 131320303210171 - 217 = 131320303079099 is a prime.

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

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

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

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

Almost surely, 2131320303210171 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2268, while the sum is 28.

The spelling of 131320303210171 in words is "one hundred thirty-one trillion, three hundred twenty billion, three hundred three million, two hundred ten thousand, one hundred seventy-one".