Search a number
-
+
11120011012147 is a prime number
BaseRepresentation
bin1010000111010001010001…
…0011100110100000110011
31110101001200200112202122011
42201310110103212200303
52424142240304342042
635352243524023351
72225252145022162
oct241642423464063
943331620482564
1011120011012147
1135a7a74355684
1212b7171231b57
136287c699588b
142a62d61473d9
151443cc5d7a17
hexa1d144e6833

11120011012147 has 2 divisors, whose sum is σ = 11120011012148. Its totient is φ = 11120011012146.

The previous prime is 11120011012049. The next prime is 11120011012237. The reversal of 11120011012147 is 74121011002111.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11120011012147 is a prime.

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

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

Almost surely, 211120011012147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 112, while the sum is 22.

Adding to 11120011012147 its reverse (74121011002111), we get a palindrome (85241022014258).

The spelling of 11120011012147 in words is "eleven trillion, one hundred twenty billion, eleven million, twelve thousand, one hundred forty-seven".