Base | Representation |
---|---|
bin | 11100111011001… |
… | …000001100000000 |
3 | 1020211002212102122 |
4 | 130323020030000 |
5 | 1443211341310 |
6 | 120052503412 |
7 | 15011442152 |
oct | 3473101400 |
9 | 1224085378 |
10 | 485262080 |
11 | 229a10646 |
12 | 11661ab68 |
13 | 796c4b34 |
14 | 4863aad2 |
15 | 2c906555 |
hex | 1cec8300 |
485262080 has 72 divisors (see below), whose sum is σ = 1166649792. Its totient is φ = 193388544.
The previous prime is 485262077. The next prime is 485262131. The reversal of 485262080 is 80262584.
It is a self number, because there is not a number n which added to its sum of digits gives 485262080.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 469244 + ... + 470276.
Almost surely, 2485262080 is an apocalyptic number.
485262080 is a gapful number since it is divisible by the number (40) 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 485262080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (583324896).
485262080 is an abundant number, since it is smaller than the sum of its proper divisors (681387712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485262080 is a wasteful number, since it uses less digits than its factorization.
485262080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1421 (or 1407 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 35.
The square root of 485262080 is about 22028.6649618174. The cubic root of 485262080 is about 785.8242954033.
The spelling of 485262080 in words is "four hundred eighty-five million, two hundred sixty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •