156913950 has 48 divisors (see below), whose sum is σ = 390974976. Its totient is φ = 41647200.

The previous prime is 156913931. The next prime is 156913957. The reversal of 156913950 is 59319651.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 2^156913950 is an apocalyptic number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 36450, while the sum is 39.

The square root of 156913950 is about 12526.5298466894. The cubic root of 156913950 is about 539.3704941469.

The spelling of 156913950 in words is "one hundred fifty-six million, nine hundred thirteen thousand, nine hundred fifty".