Search a number
-
+
112911111113 is a prime number
BaseRepresentation
bin110100100101000000…
…1101101001111001001
3101210102222011202002012
41221022001231033021
53322220221023423
6123512020545305
711105020415603
oct1511201551711
9353388152065
10112911111113
1143981418a69
1219a71852235
13a85565b168
145671a8c173
152e0c97e078
hex1a4a06d3c9

112911111113 has 2 divisors, whose sum is σ = 112911111114. Its totient is φ = 112911111112.

The previous prime is 112911111091. The next prime is 112911111167. The reversal of 112911111113 is 311111119211.

It is a happy number.

It is a m-pointer prime, because the next prime (112911111167) can be obtained adding 112911111113 to its product of digits (54).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96390379024 + 16520732089 = 310468^2 + 128533^2 .

It is a cyclic number.

It is not a de Polignac number, because 112911111113 - 214 = 112911094729 is a prime.

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

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

Almost surely, 2112911111113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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