Search a number
-
+
111121311151 is a prime number
BaseRepresentation
bin110011101111101011…
…0001010010110101111
3101121211020100111002201
41213133112022112233
53310034023424101
6123014243202331
711012455363114
oct1473726122657
9347736314081
10111121311151
11431430a0844
12196523763a7
13a62b8cca26
1455420ac90b
152d5578ce01
hex19df58a5af

111121311151 has 2 divisors, whose sum is σ = 111121311152. Its totient is φ = 111121311150.

The previous prime is 111121311149. The next prime is 111121311181. The reversal of 111121311151 is 151113121111.

It is a m-pointer prime, because the next prime (111121311181) can be obtained adding 111121311151 to its product of digits (30).

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 111121311151 - 21 = 111121311149 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2111121311151 is an apocalyptic number.

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

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

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

The product of its digits is 30, while the sum is 19.

Adding to 111121311151 its reverse (151113121111), we get a palindrome (262234432262).

The spelling of 111121311151 in words is "one hundred eleven billion, one hundred twenty-one million, three hundred eleven thousand, one hundred fifty-one".