Search a number
-
+
1111112111191 is a prime number
BaseRepresentation
bin10000001010110011011…
…100010101010001010111
310221012222022110111121111
4100022303130111101113
5121201024200024231
62210234324355451
7143163252054115
oct20126334252127
93835868414544
101111112111191
11399246902665
1215b411245b87
1380a14cc6bb4
143bac71dcab5
151dd812d84b1
hex102b3715457

1111112111191 has 2 divisors, whose sum is σ = 1111112111192. Its totient is φ = 1111112111190.

The previous prime is 1111112111173. The next prime is 1111112111209. The reversal of 1111112111191 is 1911112111111.

It is a m-pointer prime, because the next prime (1111112111209) can be obtained adding 1111112111191 to its product of digits (18).

It is a balanced prime because it is at equal distance from previous prime (1111112111173) and next prime (1111112111209).

It is a cyclic number.

It is not a de Polignac number, because 1111112111191 - 211 = 1111112109143 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21111112111191 is an apocalyptic number.

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

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

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

The product of its digits is 18, while the sum is 22.

The spelling of 1111112111191 in words is "one trillion, one hundred eleven billion, one hundred twelve million, one hundred eleven thousand, one hundred ninety-one".