156700920 has 128 divisors (see below), whose sum is σ = 499867200. Its totient is φ = 39223296.

The previous prime is 156700919. The next prime is 156700927. The reversal of 156700920 is 29007651.

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

It is a congruent number.

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

Almost surely, 2^156700920 is an apocalyptic number.

156700920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 156700920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (249933600).

156700920 is an abundant number, since it is smaller than the sum of its proper divisors (343166280).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 1297 (or 1293 counting only the distinct ones).

The product of its (nonzero) digits is 3780, while the sum is 30.

The square root of 156700920 is about 12518.0238056971. The cubic root of 156700920 is about 539.1262963269.

The spelling of 156700920 in words is "one hundred fifty-six million, seven hundred thousand, nine hundred twenty".