Search a number
-
+
11801257157 is a prime number
BaseRepresentation
bin10101111110110100…
…01110010011000101
31010110110010222102102
422333122032103011
5143132110212112
65231005521445
7565306013354
oct127732162305
933413128372
1011801257157
115006558198
122354273285
131160c2a801
147dd48599b
154910b3bc2
hex2bf68e4c5

11801257157 has 2 divisors, whose sum is σ = 11801257158. Its totient is φ = 11801257156.

The previous prime is 11801257121. The next prime is 11801257229. The reversal of 11801257157 is 75175210811.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6580616641 + 5220640516 = 81121^2 + 72254^2 .

It is an emirp because it is prime and its reverse (75175210811) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11801257157 - 216 = 11801191621 is a prime.

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

It is a congruent number.

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

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

Almost surely, 211801257157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 19600, while the sum is 38.

Adding to 11801257157 its reverse (75175210811), we get a palindrome (86976467968).

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