156896952 has 64 divisors (see below), whose sum is σ = 407116800. Its totient is φ = 50334720.

The previous prime is 156896947. The next prime is 156896959. The reversal of 156896952 is 259698651.

It is a super-3 number, since 3×156896952³ (a number of 26 digits) contains 333 as substring.

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

It is a congruent number.

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

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

Almost surely, 2^156896952 is an apocalyptic number.

156896952 is a gapful number since it is divisible by the number (12) 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 156896952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203558400).

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

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

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

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

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

The product of its digits is 1166400, while the sum is 51.

The square root of 156896952 is about 12525.8513483116. The cubic root of 156896952 is about 539.3510173344.

The spelling of 156896952 in words is "one hundred fifty-six million, eight hundred ninety-six thousand, nine hundred fifty-two".