Search a number
-
+
2011200011111 is a prime number
BaseRepresentation
bin11101010001000100110…
…111001011101101100111
321010021020222122100212102
4131101010313023231213
5230422414200323421
64135533232042315
7265206261012464
oct35210467135547
97107228570772
102011200011111
11705a43a79a15
1228594a99339b
13117869a4b095
146d4b214666b
15374b13c960b
hex1d444dcbb67

2011200011111 has 2 divisors, whose sum is σ = 2011200011112. Its totient is φ = 2011200011110.

The previous prime is 2011200011069. The next prime is 2011200011143. The reversal of 2011200011111 is 1111100021102.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 2011200011111 - 222 = 2011195816807 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 22011200011111 is an apocalyptic number.

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

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

2011200011111 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 2011200011111 its reverse (1111100021102), we get a palindrome (3122300032213).

Subtracting from 2011200011111 its reverse (1111100021102), we obtain a palindrome (900099990009).

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