Search a number
-
+
11198052157 is a prime number
BaseRepresentation
bin10100110110111010…
…01011011100111101
31001220102002222201111
422123131023130331
5140413200132112
65051101042021
7544332605245
oct123335133475
931812088644
1011198052157
114827010366
122206256311
131095c7c186
14783306b25
154581615a7
hex29b74b73d

11198052157 has 2 divisors, whose sum is σ = 11198052158. Its totient is φ = 11198052156.

The previous prime is 11198052091. The next prime is 11198052197. The reversal of 11198052157 is 75125089111.

It is an a-pointer prime, because the next prime (11198052197) can be obtained adding 11198052157 to its sum of digits (40).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11013662916 + 184389241 = 104946^2 + 13579^2 .

It is a cyclic number.

It is not a de Polignac number, because 11198052157 - 215 = 11198019389 is a prime.

It is a super-2 number, since 2×111980521572 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 211198052157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 40.

The spelling of 11198052157 in words is "eleven billion, one hundred ninety-eight million, fifty-two thousand, one hundred fifty-seven".