Search a number
-
+
131677057175141 is a prime number
BaseRepresentation
bin11101111100001001110100…
…001101111100111001100101
3122021020012111111221211221202
4131330021310031330321211
5114224344103114101031
61144015334401252245
736510232141405022
oct3574116415747145
9567205444854852
10131677057175141
1138a57a20a63935
1212927a90034085
135862129a29a3a
1424732bc862549
151035350aed2cb
hex77c27437ce65

131677057175141 has 2 divisors, whose sum is σ = 131677057175142. Its totient is φ = 131677057175140.

The previous prime is 131677057175113. The next prime is 131677057175159. The reversal of 131677057175141 is 141571750776131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 76729365820900 + 54947691354241 = 8759530^2 + 7412671^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2131677057175141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4321800, while the sum is 56.

The spelling of 131677057175141 in words is "one hundred thirty-one trillion, six hundred seventy-seven billion, fifty-seven million, one hundred seventy-five thousand, one hundred forty-one".