Search a number
-
+
11111153141111 is a prime number
BaseRepresentation
bin1010000110110000010001…
…0101100000010101110111
31110100012211100220021220112
42201230010111200111313
52424021120201003421
635344220541053235
72224516506246242
oct241540425402567
943305740807815
1011111153141111
1135a4239310001
1212b54ba85721b
13627a147b997a
142a5ad596c259
1514405eb3345b
hexa1b04560577

11111153141111 has 2 divisors, whose sum is σ = 11111153141112. Its totient is φ = 11111153141110.

The previous prime is 11111153141089. The next prime is 11111153141171. The reversal of 11111153141111 is 11114135111111.

It is a m-pointer prime, because the next prime (11111153141171) can be obtained adding 11111153141111 to its product of digits (60).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11111153141111 - 226 = 11111086032247 is a prime.

It is a congruent number.

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

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

Almost surely, 211111153141111 is an apocalyptic number.

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

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

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

The product of its digits is 60, while the sum is 23.

Adding to 11111153141111 its reverse (11114135111111), we get a palindrome (22225288252222).

The spelling of 11111153141111 in words is "eleven trillion, one hundred eleven billion, one hundred fifty-three million, one hundred forty-one thousand, one hundred eleven".