Search a number
-
+
132001102169 is a prime number
BaseRepresentation
bin111101011101111100…
…0001111100101011001
3110121201101100202201222
41322323320033211121
54130314240232134
6140350201421425
712352052566316
oct1727370174531
9417641322658
10132001102169
1150a881a9882
12216baa9a875
13c5a8646761
14656316dd0d
153678892a2e
hex1ebbe0f959

132001102169 has 2 divisors, whose sum is σ = 132001102170. Its totient is φ = 132001102168.

The previous prime is 132001102091. The next prime is 132001102243. The reversal of 132001102169 is 961201100231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 107465952400 + 24535149769 = 327820^2 + 156637^2 .

It is a cyclic number.

It is not a de Polignac number, because 132001102169 - 216 = 132001036633 is a prime.

It is a super-2 number, since 2×1320011021692 (a number of 23 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2132001102169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 26.

The spelling of 132001102169 in words is "one hundred thirty-two billion, one million, one hundred two thousand, one hundred sixty-nine".