Search a number
-
+
131141122431509 is a prime number
BaseRepresentation
bin11101110100010110101100…
…000001001001101000010101
3122012022222011022012000120102
4131310112230001021220111
5114142104004320302014
61142525222215543445
736423430160300051
oct3564265401115025
9565288138160512
10131141122431509
1138870701852703
121286004068ab85
135823729b18768
14245539ad30c61
1510264353488de
hex7745ac049a15

131141122431509 has 2 divisors, whose sum is σ = 131141122431510. Its totient is φ = 131141122431508.

The previous prime is 131141122431337. The next prime is 131141122431533. The reversal of 131141122431509 is 905134221141131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 87703505950225 + 43437616481284 = 9365015^2 + 6590722^2 .

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

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2131141122431509 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25920, while the sum is 38.

The spelling of 131141122431509 in words is "one hundred thirty-one trillion, one hundred forty-one billion, one hundred twenty-two million, four hundred thirty-one thousand, five hundred nine".