Search a number
-
+
200210122220111 is a prime number
BaseRepresentation
bin101101100001011100001101…
…001101110010001001001111
3222020212220022122122210122222
4231201130031031302021033
5202220220312242020421
61545451132125525555
760112463316602363
oct5541341515621117
9866786278583588
10200210122220111
115887a6aa587313
121a556090a138bb
13879396c6bbac3
1437623161a12a3
151822dd0eb4cab
hexb6170d37224f

200210122220111 has 2 divisors, whose sum is σ = 200210122220112. Its totient is φ = 200210122220110.

The previous prime is 200210122220107. The next prime is 200210122220299. The reversal of 200210122220111 is 111022221012002.

200210122220111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 200210122220111 - 22 = 200210122220107 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 200210122220111.

It is a congruent number.

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

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

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

Almost surely, 2200210122220111 is an apocalyptic number.

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

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

200210122220111 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 64, while the sum is 17.

Adding to 200210122220111 its reverse (111022221012002), we get a palindrome (311232343232113).

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