Search a number
-
+
158947661 is a prime number
BaseRepresentation
bin10010111100101…
…01100101001101
3102002002101012102
421132111211031
5311142311121
623434444445
73640014155
oct1136254515
9362071172
10158947661
11817a3804
1245293725
1326c12792
1417177765
15de4a90b
hex979594d

158947661 has 2 divisors, whose sum is σ = 158947662. Its totient is φ = 158947660.

The previous prime is 158947631. The next prime is 158947697. The reversal of 158947661 is 166749851.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 92525161 + 66422500 = 9619^2 + 8150^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 158947661 - 210 = 158946637 is a prime.

It is a Chen prime.

It is equal to p8918678 and since 158947661 and 8918678 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

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

Almost surely, 2158947661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 362880, while the sum is 47.

The square root of 158947661 is about 12607.4446657521. Note that the first 3 decimals coincide. The cubic root of 158947661 is about 541.6907012399.

The spelling of 158947661 in words is "one hundred fifty-eight million, nine hundred forty-seven thousand, six hundred sixty-one".