Search a number
-
+
212220100211111 is a prime number
BaseRepresentation
bin110000010000001101010111…
…101011111111000110100111
31000211102001011200002100220122
4300100031113223333012213
5210304003231123223421
62031204322414552155
762462252630262566
oct6020152753770647
91024361150070818
10212220100211111
1161690048003473
121b97581620865b
139155367361175
143a59717013bdd
1519804e9d972ab
hexc10357aff1a7

212220100211111 has 2 divisors, whose sum is σ = 212220100211112. Its totient is φ = 212220100211110.

The previous prime is 212220100211081. The next prime is 212220100211117. The reversal of 212220100211111 is 111112001022212.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 212220100211111 - 26 = 212220100211047 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

Almost surely, 2212220100211111 is an apocalyptic number.

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

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

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

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

Adding to 212220100211111 its reverse (111112001022212), we get a palindrome (323332101233323).

The spelling of 212220100211111 in words is "two hundred twelve trillion, two hundred twenty billion, one hundred million, two hundred eleven thousand, one hundred eleven".