485110152 has 48 divisors (see below), whose sum is σ = 1317804540. Its totient is φ = 161215488.

The previous prime is 485110141. The next prime is 485110187. The reversal of 485110152 is 251011584.

It can be written as a sum of positive squares in 2 ways, for example, as 482505156 + 2604996 = 21966^2 + 1614^2 .

It is an unprimeable number.

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 11 ways as a sum of consecutive naturals, for example, 14268 + ... + 34260.

Almost surely, 2^485110152 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The square root of 485110152 is about 22025.2162758961. The cubic root of 485110152 is about 785.7422770602.

The spelling of 485110152 in words is "four hundred eighty-five million, one hundred ten thousand, one hundred fifty-two".