Search a number
-
+
11011101111089 is a prime number
BaseRepresentation
bin1010000000111011100011…
…0001010011001100110001
31102222122120120100112212222
42200032320301103030301
52420401213341023324
635230232514530425
72214345231106562
oct240167061231461
942878516315788
1011011101111089
113565866577a92
12129a037596a15
1361b45b290b41
142a0d23a46169
1514165606c55e
hexa03b8c53331

11011101111089 has 2 divisors, whose sum is σ = 11011101111090. Its totient is φ = 11011101111088.

The previous prime is 11011101111079. The next prime is 11011101111091. The reversal of 11011101111089 is 98011110111011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9961705751089 + 1049395360000 = 3156217^2 + 1024400^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11011101111089 is a prime.

Together with 11011101111091, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 211011101111089 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 26.

The spelling of 11011101111089 in words is "eleven trillion, eleven billion, one hundred one million, one hundred eleven thousand, eighty-nine".