Search a number
-
+
156928361 = 4137910099
BaseRepresentation
bin10010101101010…
…00100101101001
3101221021210020112
421112220211221
5310133201421
623323304105
73613604042
oct1126504551
9357253215
10156928361
1180644667
124467b035
1326686625
1416bad8c9
15db9c45b
hex95a8969

156928361 has 8 divisors (see below), whose sum is σ = 161196000. Its totient is φ = 152681760.

The previous prime is 156928357. The next prime is 156928363. The reversal of 156928361 is 163829651.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 156928361 - 22 = 156928357 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (41).

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (156928363) 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 in 7 ways as a sum of consecutive naturals, for example, 10490 + ... + 20588.

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

Almost surely, 2156928361 is an apocalyptic number.

It is an amenable number.

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

156928361 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 10519.

The product of its digits is 77760, while the sum is 41.

The square root of 156928361 is about 12527.1050526448. The cubic root of 156928361 is about 539.3870055963.

The spelling of 156928361 in words is "one hundred fifty-six million, nine hundred twenty-eight thousand, three hundred sixty-one".

Divisors: 1 41 379 10099 15539 414059 3827521 156928361