Search a number
-
+
2000210111111 is a prime number
BaseRepresentation
bin11101000110110101110…
…100000010101010000111
321002012220002012121020002
4131012311310002222013
5230232412242023421
64130514524231515
7264340033263632
oct35066564025207
97065802177202
102000210111111
1170131450a433
122837a239b59b
13116807c4b984
146cb4c744c19
153706b682b0b
hex1d1b5d02a87

2000210111111 has 2 divisors, whose sum is σ = 2000210111112. Its totient is φ = 2000210111110.

The previous prime is 2000210111099. The next prime is 2000210111129. The reversal of 2000210111111 is 1111110120002.

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-2000210111111 is a prime.

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

Almost surely, 22000210111111 is an apocalyptic number.

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

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

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

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

Adding to 2000210111111 its reverse (1111110120002), we get a palindrome (3111320231113).

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