Search a number
-
+
158064139 is a prime number
BaseRepresentation
bin10010110101111…
…01111000001011
3102000102111020101
421122331320023
5310431023024
623403510231
73626344252
oct1132757013
9360374211
10158064139
118124aa22
1244b28377
132699359c
1416dc7799
15dd23c44
hex96bde0b

158064139 has 2 divisors, whose sum is σ = 158064140. Its totient is φ = 158064138.

The previous prime is 158064107. The next prime is 158064163. The reversal of 158064139 is 931460851.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 158064139 - 25 = 158064107 is a prime.

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

It is a Chen prime.

It is equal to p8872057 and since 158064139 and 8872057 have the same sum of digits, it is a Honaker prime.

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

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

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

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

Almost surely, 2158064139 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 25920, while the sum is 37.

The square root of 158064139 is about 12572.3561435397. The cubic root of 158064139 is about 540.6851602403.

It can be divided in two parts, 158064 and 139, that added together give a triangular number (158203 = T562).

The spelling of 158064139 in words is "one hundred fifty-eight million, sixty-four thousand, one hundred thirty-nine".