Search a number
-
+
161556047 is a prime number
BaseRepresentation
bin10011010000100…
…10011001001111
3102020222220020022
421220102121033
5312324243142
624010412355
74001126612
oct1150223117
9366886208
10161556047
11832154a4
12461310bb
1327616ac3
1417656179
15e2b36d2
hex9a1264f

161556047 has 2 divisors, whose sum is σ = 161556048. Its totient is φ = 161556046.

The previous prime is 161556011. The next prime is 161556077. The reversal of 161556047 is 740655161.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 161556047 - 226 = 94447183 is a prime.

It is a super-2 number, since 2×1615560472 = 52200712644532418, which contains 22 as substring.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 161555998 and 161556016.

It is a congruent number.

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

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

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

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

Almost surely, 2161556047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 35.

The square root of 161556047 is about 12710.4699755753. The cubic root of 161556047 is about 544.6377493407.

The spelling of 161556047 in words is "one hundred sixty-one million, five hundred fifty-six thousand, forty-seven".