Search a number
-
+
11113110131 is a prime number
BaseRepresentation
bin10100101100110010…
…01001101001110011
31001200111021111011112
422112121021221303
5140224424011011
65034424303535
7542251606664
oct122631115163
931614244145
1011113110131
114793074142
1221a1911bab
1310814ab516
14775d1536b
1545098358b
hex296649a73

11113110131 has 2 divisors, whose sum is σ = 11113110132. Its totient is φ = 11113110130.

The previous prime is 11113110121. The next prime is 11113110133. The reversal of 11113110131 is 13101131111.

11113110131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11113110131 - 218 = 11112847987 is a prime.

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

Together with 11113110133, 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 (11113110133) by changing a digit.

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

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

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

Almost surely, 211113110131 is an apocalyptic number.

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

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

11113110131 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 14.

Adding to 11113110131 its reverse (13101131111), we get a palindrome (24214241242).

The spelling of 11113110131 in words is "eleven billion, one hundred thirteen million, one hundred ten thousand, one hundred thirty-one".