Search a number
-
+
131487567557 is a prime number
BaseRepresentation
bin111101001110101000…
…1010000111011000101
3110120101121001111200112
41322131101100323011
54123241304130212
6140223214522405
712333245612003
oct1723521207305
9416347044615
10131487567557
1150844338705
1221596b06405
13c526133018
146514c93a73
153648754422
hex1e9d450ec5

131487567557 has 2 divisors, whose sum is σ = 131487567558. Its totient is φ = 131487567556.

The previous prime is 131487567527. The next prime is 131487567593. The reversal of 131487567557 is 755765784131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 131483111236 + 4456321 = 362606^2 + 2111^2 .

It is a cyclic number.

It is not a de Polignac number, because 131487567557 - 216 = 131487502021 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 131487567496 and 131487567505.

It is a congruent number.

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

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

Almost surely, 2131487567557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 24696000, while the sum is 59.

The spelling of 131487567557 in words is "one hundred thirty-one billion, four hundred eighty-seven million, five hundred sixty-seven thousand, five hundred fifty-seven".