Search a number
-
+
131558896153 is a prime number
BaseRepresentation
bin111101010000110000…
…1010111001000011001
3110120120120021101010101
41322201201113020121
54123413034134103
6140234243415401
712335103111046
oct1724141271031
9416516241111
10131558896153
1150880626963
12215b6984561
13c537b484a9
1465205401cd
15364eb43a1d
hex1ea1857219

131558896153 has 2 divisors, whose sum is σ = 131558896154. Its totient is φ = 131558896152.

The previous prime is 131558896087. The next prime is 131558896163. The reversal of 131558896153 is 351698855131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130372989184 + 1185906969 = 361072^2 + 34437^2 .

It is a cyclic number.

It is not a de Polignac number, because 131558896153 - 217 = 131558765081 is a prime.

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

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

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

Almost surely, 2131558896153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3888000, while the sum is 55.

The spelling of 131558896153 in words is "one hundred thirty-one billion, five hundred fifty-eight million, eight hundred ninety-six thousand, one hundred fifty-three".