Search a number
-
+
11011112113 is a prime number
BaseRepresentation
bin10100100000101000…
…00011110010110001
31001102101100110012011
422100110003302301
5140022321041423
65020342202521
7536602623451
oct122024036261
931371313164
1011011112113
114740538561
122173723441
131066318471
14766563d61
15446a36b0d
hex290503cb1

11011112113 has 2 divisors, whose sum is σ = 11011112114. Its totient is φ = 11011112112.

The previous prime is 11011112071. The next prime is 11011112117. The reversal of 11011112113 is 31121111011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9410552064 + 1600560049 = 97008^2 + 40007^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011112113 - 213 = 11011103921 is a prime.

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

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

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

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

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

Almost surely, 211011112113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 13.

Adding to 11011112113 its reverse (31121111011), we get a palindrome (42132223124).

The spelling of 11011112113 in words is "eleven billion, eleven million, one hundred twelve thousand, one hundred thirteen".