Search a number
-
+
11100120111011 is a prime number
BaseRepresentation
bin1010000110000111001010…
…1101110101011110100011
31110022011100110022021220002
42201201302231311132203
52423331021222023021
635335154053010215
72223646216114601
oct241416255653643
943264313267802
1011100120111011
11359a597472208
1212b333b92396b
13626976a990a9
142a536a540871
15143b1621c50b
hexa1872b757a3

11100120111011 has 2 divisors, whose sum is σ = 11100120111012. Its totient is φ = 11100120111010.

The previous prime is 11100120110971. The next prime is 11100120111023. The reversal of 11100120111011 is 11011102100111.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11100120111011 - 210 = 11100120109987 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (11100120111911) 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, 5550060055505 + 5550060055506.

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

Almost surely, 211100120111011 is an apocalyptic number.

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

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

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

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

Adding to 11100120111011 its reverse (11011102100111), we get a palindrome (22111222211122).

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