Search a number
-
+
200211101100011 is a prime number
BaseRepresentation
bin101101100001011101000111…
…100011111010011111101011
3222020212222211212121001110002
4231201131013203322133223
5202220224313340200021
61545451413214413215
760112526504130551
oct5541350743723753
9866788755531402
10200211101100011
1158880062095271
121a55630480120b
138793a97442a91
1437623aa1b1bd1
151822e3bdc350b
hexb617478fa7eb

200211101100011 has 2 divisors, whose sum is σ = 200211101100012. Its totient is φ = 200211101100010.

The previous prime is 200211101099969. The next prime is 200211101100013. The reversal of 200211101100011 is 110001101112002.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 200211101100011 - 214 = 200211101083627 is a prime.

Together with 200211101100013, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

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

Almost surely, 2200211101100011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 200211101100011 its reverse (110001101112002), we get a palindrome (310212202212013).

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