Search a number
-
+
201122002157 is a prime number
BaseRepresentation
bin1011101101001111001…
…1100011010011101101
3201020010112112022002212
42323103303203103231
511243344213032112
6232221050300205
720346663545216
oct2732363432355
9636115468085
10201122002157
117832814400a
1232b8b427665
1315c7290468b
149a3d10a40d
155371c04522
hex2ed3ce34ed

201122002157 has 2 divisors, whose sum is σ = 201122002158. Its totient is φ = 201122002156.

The previous prime is 201122002093. The next prime is 201122002163. The reversal of 201122002157 is 751200221102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 201121753156 + 249001 = 448466^2 + 499^2 .

It is a cyclic number.

It is not a de Polignac number, because 201122002157 - 26 = 201122002093 is a prime.

It is a congruent number.

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

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

Almost surely, 2201122002157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 560, while the sum is 23.

Adding to 201122002157 its reverse (751200221102), we get a palindrome (952322223259).

The spelling of 201122002157 in words is "two hundred one billion, one hundred twenty-two million, two thousand, one hundred fifty-seven".