Search a number
-
+
202210000011211 is a prime number
BaseRepresentation
bin101101111110100010101111…
…001110000111111111001011
3222111222002100120112210112111
4231332202233032013333023
5203001002040000324321
61554021554103323151
760410122206416323
oct5576425716077713
9874862316483474
10202210000011211
1159480863447805
121a81979ba504b7
1388aa4238349ca
1437d103271c283
151859e2d3a25e1
hexb7e8af387fcb

202210000011211 has 2 divisors, whose sum is σ = 202210000011212. Its totient is φ = 202210000011210.

The previous prime is 202210000011193. The next prime is 202210000011247. The reversal of 202210000011211 is 112110000012202.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 202210000011211 - 211 = 202210000009163 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 202210000011191 and 202210000011200.

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

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

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

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

Almost surely, 2202210000011211 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 202210000011211 its reverse (112110000012202), we get a palindrome (314320000023413).

Subtracting from 202210000011211 its reverse (112110000012202), we obtain a palindrome (90099999999009).

The spelling of 202210000011211 in words is "two hundred two trillion, two hundred ten billion, eleven thousand, two hundred eleven".