Search a number
-
+
132201116219 is a prime number
BaseRepresentation
bin111101100011111001…
…1001111001000111011
3110122020022201112102202
41323013303033020323
54131221441204334
6140422104420415
712360031642544
oct1730763171073
9418208645382
10132201116219
11510800a1347
1221755a7770b
13c60ac07273
1465819574cb
15368b20117e
hex1ec7ccf23b

132201116219 has 2 divisors, whose sum is σ = 132201116220. Its totient is φ = 132201116218.

The previous prime is 132201116207. The next prime is 132201116221. The reversal of 132201116219 is 912611102231.

It is a strong prime.

It is an emirp because it is prime and its reverse (912611102231) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 132201116219 - 224 = 132184339003 is a prime.

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

Together with 132201116221, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 2132201116219 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 29.

The spelling of 132201116219 in words is "one hundred thirty-two billion, two hundred one million, one hundred sixteen thousand, two hundred nineteen".