Search a number
-
+
11101217047 is a prime number
BaseRepresentation
bin10100101011010111…
…10010000100010111
31001122122220020220221
422111223302010113
5140213402421142
65033321335211
7542045534164
oct122553620427
931578806827
1011101217047
114787390748
122199937507
13107bba60ab
147744db06b
1544e8d4767
hex295af2117

11101217047 has 2 divisors, whose sum is σ = 11101217048. Its totient is φ = 11101217046.

The previous prime is 11101217027. The next prime is 11101217051. The reversal of 11101217047 is 74071210111.

11101217047 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 a de Polignac number, because none of the positive numbers 2k-11101217047 is a prime.

It is a congruent number.

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

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

Almost surely, 211101217047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 392, while the sum is 25.

Adding to 11101217047 its reverse (74071210111), we get a palindrome (85172427158).

The spelling of 11101217047 in words is "eleven billion, one hundred one million, two hundred seventeen thousand, forty-seven".