Search a number
-
+
200011101211111 is a prime number
BaseRepresentation
bin101101011110100010110110…
…101000111000100111100111
3222020011212121112112000100111
4231132202312220320213213
5202203440213402223421
61545215455330553451
760062216354125501
oct5536426650704747
9866155545460314
10200011101211111
115880326039a593
121a5235a9138887
13877ac73162358
14375683611cd71
15181cb33971ee1
hexb5e8b6a389e7

200011101211111 has 2 divisors, whose sum is σ = 200011101211112. Its totient is φ = 200011101211110.

The previous prime is 200011101211067. The next prime is 200011101211139. The reversal of 200011101211111 is 111112101110002.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 200011101211111 - 27 = 200011101210983 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2200011101211111 is an apocalyptic number.

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

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

200011101211111 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 13.

Adding to 200011101211111 its reverse (111112101110002), we get a palindrome (311123202321113).

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