Search a number
-
+
211222110220097 is a prime number
BaseRepresentation
bin110000000001101011111010…
…110110010010111101000001
31000200212122012000211222101212
4300001223322312102331001
5210141130340204020342
62025122033045535505
762330202540313214
oct6001537266227501
91020778160758355
10211222110220097
1161335880741029
121b834315414595
1390b220c635672
143a232c190d77b
151964589d1e182
hexc01afad92f41

211222110220097 has 2 divisors, whose sum is σ = 211222110220098. Its totient is φ = 211222110220096.

The previous prime is 211222110220091. The next prime is 211222110220123. The reversal of 211222110220097 is 790022011222112.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 192274580748721 + 18947529471376 = 13866311^2 + 4352876^2 .

It is a cyclic number.

It is not a de Polignac number, because 211222110220097 - 224 = 211222093442881 is a prime.

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

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

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

Almost surely, 2211222110220097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4032, while the sum is 32.

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