Search a number
-
+
11100211111111 is a prime number
BaseRepresentation
bin1010000110000111100000…
…1000111110010011000111
31110022011120210112120120011
42201201320020332103013
52423331213021023421
635335211103251051
72223651402444163
oct241417010762307
943264523476504
1011100211111111
11359a633876a01
1212b33662a9a87
1362698c8ab2c5
142a537866bca3
15143b1e1e54e1
hexa187823e4c7

11100211111111 has 2 divisors, whose sum is σ = 11100211111112. Its totient is φ = 11100211111110.

The previous prime is 11100211111097. The next prime is 11100211111163. The reversal of 11100211111111 is 11111111200111.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11100211111111 - 215 = 11100211078343 is a prime.

It is a super-2 number, since 2×111002111111112 (a number of 27 digits) contains 22 as substring.

11100211111111 is a modest number, since divided by 1111111 gives 1110021 as remainder.

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

It is a congruent number.

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

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

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

Almost surely, 211100211111111 is an apocalyptic number.

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

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

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

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

Adding to 11100211111111 its reverse (11111111200111), we get a palindrome (22211322311222).

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