Search a number
-
+
158904954157 is a prime number
BaseRepresentation
bin1001001111111101111…
…0010010110100101101
3120012011100201001111111
42103333132102310231
510100414132013112
6200555552352021
714323545552505
oct2237736226455
9505140631444
10158904954157
1161433781aa4
1226968b45611
1311ca5431bc1
147996304a05
1542007845a7
hex24ff792d2d

158904954157 has 2 divisors, whose sum is σ = 158904954158. Its totient is φ = 158904954156.

The previous prime is 158904954121. The next prime is 158904954163. The reversal of 158904954157 is 751459409851.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 158809423081 + 95531076 = 398509^2 + 9774^2 .

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

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2158904954157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9072000, while the sum is 58.

The spelling of 158904954157 in words is "one hundred fifty-eight billion, nine hundred four million, nine hundred fifty-four thousand, one hundred fifty-seven".