Search a number
-
+
11011010111119 is a prime number
BaseRepresentation
bin1010000000111011001101…
…0110001010011010001111
31102222122100020010021101201
42200032303112022122033
52420401022042023434
635230215504250331
72214343044450544
oct240166326123217
942878306107351
1011011010111119
11356581a1733a7
12129a0110109a7
1361b44547b9c5
142a0d15918bcb
1514164d094614
hexa03b358a68f

11011010111119 has 2 divisors, whose sum is σ = 11011010111120. Its totient is φ = 11011010111118.

The previous prime is 11011010111083. The next prime is 11011010111141. The reversal of 11011010111119 is 91111101011011.

It is a happy number.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 11011010111119 - 219 = 11011009586831 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 211011010111119 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9, while the sum is 19.

The spelling of 11011010111119 in words is "eleven trillion, eleven billion, ten million, one hundred eleven thousand, one hundred nineteen".