Search a number
-
+
132169398157 is a prime number
BaseRepresentation
bin111101100010111101…
…0001111011110001101
3110122011010001002102201
41323011322033132031
54131140331220112
6140415012521501
712356165230216
oct1730572173615
9418133032381
10132169398157
11510641a8075
1221747320291
13c604480294
14657b65c40d
153688538257
hex1ec5e8f78d

132169398157 has 2 divisors, whose sum is σ = 132169398158. Its totient is φ = 132169398156.

The previous prime is 132169398043. The next prime is 132169398161. The reversal of 132169398157 is 751893961231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 132167875401 + 1522756 = 363549^2 + 1234^2 .

It is a cyclic number.

It is not a de Polignac number, because 132169398157 - 219 = 132168873869 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2132169398157 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 132169398157 in words is "one hundred thirty-two billion, one hundred sixty-nine million, three hundred ninety-eight thousand, one hundred fifty-seven".