Search a number
-
+
156099137 = 236786919
BaseRepresentation
bin10010100110111…
…10001001000001
3101212201122202112
421103132021001
5304430133022
623253425105
73603551345
oct1123361101
9355648675
10156099137
1180128657
124433b195
132645606c
1416a35625
15da868e2
hex94de241

156099137 has 4 divisors (see below), whose sum is σ = 162886080. Its totient is φ = 149312196.

The previous prime is 156099127. The next prime is 156099157. The reversal of 156099137 is 731990651.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 156099137 - 212 = 156095041 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (156099127) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3393437 + ... + 3393482.

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

Almost surely, 2156099137 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6786942.

The product of its (nonzero) digits is 51030, while the sum is 41.

The square root of 156099137 is about 12493.9640226791. The cubic root of 156099137 is about 538.4352702984.

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

Divisors: 1 23 6786919 156099137