Base | Representation |
---|---|
bin | 11100111000101… |
… | …000010101011000 |
3 | 1020202212121021021 |
4 | 130320220111120 |
5 | 1443024413240 |
6 | 120030452224 |
7 | 15003044221 |
oct | 3470502530 |
9 | 1222777237 |
10 | 484607320 |
11 | 22960371a |
12 | 116364074 |
13 | 79525ac2 |
14 | 4850a248 |
15 | 2c82754a |
hex | 1ce28558 |
484607320 has 32 divisors (see below), whose sum is σ = 1097601120. Its totient is φ = 192556800.
The previous prime is 484607273. The next prime is 484607327. The reversal of 484607320 is 23706484.
It is a Smith number, since the sum of its digits (34) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (484607327) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 34077 + ... + 46156.
It is an arithmetic number, because the mean of its divisors is an integer number (34300035).
Almost surely, 2484607320 is an apocalyptic number.
484607320 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
484607320 is an abundant number, since it is smaller than the sum of its proper divisors (612993800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
484607320 is a wasteful number, since it uses less digits than its factorization.
484607320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80395 (or 80391 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 34.
The square root of 484607320 is about 22013.7984000944. The cubic root of 484607320 is about 785.4707009741.
The spelling of 484607320 in words is "four hundred eighty-four million, six hundred seven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.733 sec. • engine limits •