Search a number
-
+
11101001020111 is a prime number
BaseRepresentation
bin1010000110001010011100…
…1110001111001011001111
31110022020121211220010000001
42201202213032033023033
52423334322230120421
635335421321545131
72224010103531652
oct241424716171317
943266554803001
1011101001020111
11359a9a9745262
1212b35469451a7
13626a8743a092
142a541152b899
15143b68727691
hexa18a738f2cf

11101001020111 has 2 divisors, whose sum is σ = 11101001020112. Its totient is φ = 11101001020110.

The previous prime is 11101001020079. The next prime is 11101001020121. The reversal of 11101001020111 is 11102010010111.

It is an a-pointer prime, because the next prime (11101001020121) can be obtained adding 11101001020111 to its sum of digits (10).

It is a strong prime.

It is an emirp because it is prime and its reverse (11102010010111) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11101001020111 - 25 = 11101001020079 is a prime.

It is a congruent number.

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

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

Almost surely, 211101001020111 is an apocalyptic number.

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

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

11101001020111 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 10.

Adding to 11101001020111 its reverse (11102010010111), we get a palindrome (22203011030222).

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