Search a number
-
+
131532161 is a prime number
BaseRepresentation
bin1111101011100…
…00010110000001
3100011111112012112
413311300112001
5232133012121
621015105105
73155001455
oct765602601
9304445175
10131532161
1168279072
1238072195
1321333ca7
141367c665
15b83275b
hex7d70581

131532161 has 2 divisors, whose sum is σ = 131532162. Its totient is φ = 131532160.

The previous prime is 131532131. The next prime is 131532169. The reversal of 131532161 is 161235131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 94090000 + 37442161 = 9700^2 + 6119^2 .

It is a cyclic number.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2131532161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 540, while the sum is 23.

The square root of 131532161 is about 11468.7471416890. The cubic root of 131532161 is about 508.5620922434.

Adding to 131532161 its reverse (161235131), we get a palindrome (292767292).

The spelling of 131532161 in words is "one hundred thirty-one million, five hundred thirty-two thousand, one hundred sixty-one".