Search a number
-
+
11100000157 is a prime number
BaseRepresentation
bin10100101011001110…
…01000111110011101
31001122120121102122221
422111213020332131
5140213100001112
65033235305341
7542032305331
oct122547107635
931576542587
1011100000157
11478672a454
12219944b251
13107b86b23c
147742a17c1
1544e743e07
hex2959c8f9d

11100000157 has 2 divisors, whose sum is σ = 11100000158. Its totient is φ = 11100000156.

The previous prime is 11100000113. The next prime is 11100000161. The reversal of 11100000157 is 75100000111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10875569796 + 224430361 = 104286^2 + 14981^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 11100000157.

It is a congruent number.

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

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

Almost surely, 211100000157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 35, while the sum is 16.

Adding to 11100000157 its reverse (75100000111), we get a palindrome (86200000268).

The spelling of 11100000157 in words is "eleven billion, one hundred million, one hundred fifty-seven", and thus it is an aban number.