Search a number
-
+
132110161 is a prime number
BaseRepresentation
bin1111101111111…
…01011101010001
3100012120220001221
413313331131101
5232310011121
621035325041
73162626551
oct767753521
9305526057
10132110161
1168633357
12382b0781
13214a70c1
141378d161
15b8e8b41
hex7dfd751

132110161 has 2 divisors, whose sum is σ = 132110162. Its totient is φ = 132110160.

The previous prime is 132110149. The next prime is 132110171. The reversal of 132110161 is 161011231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 71503936 + 60606225 = 8456^2 + 7785^2 .

It is a cyclic number.

It is not a de Polignac number, because 132110161 - 25 = 132110129 is a prime.

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

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

Almost surely, 2132110161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 16.

The square root of 132110161 is about 11493.9184354162. The cubic root of 132110161 is about 509.3059391285.

Adding to 132110161 its reverse (161011231), we get a palindrome (293121392).

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