Search a number
-
+
2011111120111 is a prime number
BaseRepresentation
bin11101010000111111100…
…100000101110011101111
321010021000210101020100011
4131100333210011303233
5230422223421320421
64135520334514051
7265204131316162
oct35207744056357
97107023336304
102011111120111
117059a8885885
12285925065927
131178544c6b62
146d4a4407ad9
15374a86bb4e1
hex1d43f905cef

2011111120111 has 2 divisors, whose sum is σ = 2011111120112. Its totient is φ = 2011111120110.

The previous prime is 2011111120099. The next prime is 2011111120157. The reversal of 2011111120111 is 1110211111102.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 2011111120111 - 211 = 2011111118063 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 22011111120111 is an apocalyptic number.

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

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

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

Adding to 2011111120111 its reverse (1110211111102), we get a palindrome (3121322231213).

Subtracting from 2011111120111 its reverse (1110211111102), we obtain a palindrome (900900009009).

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