Search a number
-
+
485253052 = 22592056157
BaseRepresentation
bin11100111011000…
…101111110111100
31020211002102001021
4130323011332330
51443211044202
6120052353524
715011403634
oct3473057674
91224072037
10485253052
11229a04889
121166158a4
13796c09ab
14486376c4
152c903a37
hex1cec5fbc

485253052 has 12 divisors (see below), whose sum is σ = 863586360. Its totient is φ = 238514096.

The previous prime is 485253037. The next prime is 485253053. The reversal of 485253052 is 250352584.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1027843 + ... + 1028314.

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

Almost surely, 2485253052 is an apocalyptic number.

It is an amenable number.

485253052 is a deficient number, since it is larger than the sum of its proper divisors (378333308).

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

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

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

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

The square root of 485253052 is about 22028.4600460404. The cubic root of 485253052 is about 785.8194221153.

The spelling of 485253052 in words is "four hundred eighty-five million, two hundred fifty-three thousand, fifty-two".

Divisors: 1 2 4 59 118 236 2056157 4112314 8224628 121313263 242626526 485253052