Search a number
-
+
158507636957 is a prime number
BaseRepresentation
bin1001001110011111001…
…0101001100011011101
3120011010200002020202122
42103213302221203131
510044110423340312
6200452320432325
714310652453355
oct2234762514335
9504120066678
10158507636957
116124a47977a
1226877a786a5
1311c4101c777
14795963bb65
1541ca950b72
hex24e7ca98dd

158507636957 has 2 divisors, whose sum is σ = 158507636958. Its totient is φ = 158507636956.

The previous prime is 158507636953. The next prime is 158507636983. The reversal of 158507636957 is 759636705851.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102464650201 + 56042986756 = 320101^2 + 236734^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 158507636957 - 22 = 158507636953 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2158507636957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 47628000, while the sum is 62.

The spelling of 158507636957 in words is "one hundred fifty-eight billion, five hundred seven million, six hundred thirty-six thousand, nine hundred fifty-seven".