Search a number
-
+
156999047 is a prime number
BaseRepresentation
bin10010101101110…
…01110110000111
3101221102101012112
421112321312013
5310142432142
623325011235
73614320112
oct1126716607
9357371175
10156999047
1180692787
12446b3b1b
13266ac85a
1416bcb579
15dbb3382
hex95b9d87

156999047 has 2 divisors, whose sum is σ = 156999048. Its totient is φ = 156999046.

The previous prime is 156999043. The next prime is 156999053. The reversal of 156999047 is 740999651.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 156999047 - 22 = 156999043 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 2156999047 is an apocalyptic number.

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

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

156999047 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 612360, while the sum is 50.

The square root of 156999047 is about 12529.9260572439. The cubic root of 156999047 is about 539.4679796715.

The spelling of 156999047 in words is "one hundred fifty-six million, nine hundred ninety-nine thousand, forty-seven".