157671052 has 48 divisors (see below), whose sum is σ = 345461760. Its totient is φ = 61171200.

The previous prime is 157671043. The next prime is 157671089. The reversal of 157671052 is 250176751.

It is a happy number.

157671052 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 82524 + ... + 84412.

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

Almost surely, 2^157671052 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 14700, while the sum is 34.

The square root of 157671052 is about 12556.7134235038. The cubic root of 157671052 is about 540.2365812920.

The spelling of 157671052 in words is "one hundred fifty-seven million, six hundred seventy-one thousand, fifty-two".