485171232 has 384 divisors, whose sum is σ = 1716019200. Its totient is φ = 116453376.

The previous prime is 485171221. The next prime is 485171233. The reversal of 485171232 is 232171584.

It is a super-2 number, since 2×485171232² = 470782248720795648, which contains 22 as substring.

Its product of digits (13440) is a multiple of the sum of its prime divisors (160).

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

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6141369 + ... + 6141447.

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

Almost surely, 2^485171232 is an apocalyptic number.

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

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

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

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

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

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

The product of its digits is 13440, while the sum is 33.

The square root of 485171232 is about 22026.6028247662. The cubic root of 485171232 is about 785.7752531613.

The spelling of 485171232 in words is "four hundred eighty-five million, one hundred seventy-one thousand, two hundred thirty-two".