94852609152 has 256 divisors, whose sum is σ = 296439091200. Its totient is φ = 26307993600.

The previous prime is 94852609151. The next prime is 94852609217. The reversal of 94852609152 is 25190625849.

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

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

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

Almost surely, 2^94852609152 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 94852609152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148219545600).

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

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

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

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

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

The product of its (nonzero) digits is 1555200, while the sum is 51.

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