Search a number
-
+
211201010011157 is a prime number
BaseRepresentation
bin110000000001011000010001…
…001011011000110000010101
31000200210121201112002022012212
4300001120101023120300111
5210140304132030324112
62025104223215123205
762325524625433115
oct6001302113306025
91020717645068185
10211201010011157
1161327933174821
121b830206b13505
1390b0229035c2a
143a2227d473045
151963c526ca522
hexc016112d8c15

211201010011157 has 2 divisors, whose sum is σ = 211201010011158. Its totient is φ = 211201010011156.

The previous prime is 211201010011151. The next prime is 211201010011217. The reversal of 211201010011157 is 751110010102112.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 210888222604081 + 312787407076 = 14521991^2 + 559274^2 .

It is a cyclic number.

It is not a de Polignac number, because 211201010011157 - 218 = 211201009749013 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2211201010011157 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 211201010011157 its reverse (751110010102112), we get a palindrome (962311020113269).

The spelling of 211201010011157 in words is "two hundred eleven trillion, two hundred one billion, ten million, eleven thousand, one hundred fifty-seven".