156932100000 has 1152 divisors, whose sum is σ = 654843087360. Its totient is φ = 36218880000.

The previous prime is 156932099941. The next prime is 156932100001. The reversal of 156932100000 is 1239651.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 596699869 + ... + 596700131.

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

Almost surely, 2^156932100000 is an apocalyptic number.

156932100000 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 156932100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (327421543680).

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

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

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

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

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

The product of its (nonzero) digits is 1620, while the sum is 27.

Adding to 156932100000 its reverse (1239651), we get a palindrome (156933339651).

The spelling of 156932100000 in words is "one hundred fifty-six billion, nine hundred thirty-two million, one hundred thousand".