Search a number
-
+
152639057 is a prime number
BaseRepresentation
bin10010001100100…
…01011001010001
3101122012212102102
421012101121101
5303033422212
623051330145
73532260554
oct1106213121
9348185372
10152639057
1179184a8a
1243150955
132581418c
14163b469b
15d6015c2
hex9191651

152639057 has 2 divisors, whose sum is σ = 152639058. Its totient is φ = 152639056.

The previous prime is 152639051. The next prime is 152639089. The reversal of 152639057 is 750936251.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 135466321 + 17172736 = 11639^2 + 4144^2 .

It is a cyclic number.

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

It is a Chen prime.

It is equal to p8584283 and since 152639057 and 8584283 have the same sum of digits, it is a Honaker prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 2152639057 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 152639057 is about 12354.7180056851. The cubic root of 152639057 is about 534.4272054009.

The spelling of 152639057 in words is "one hundred fifty-two million, six hundred thirty-nine thousand, fifty-seven".