Base | Representation |
---|---|
bin | 11100111111111… |
… | …011010111011000 |
3 | 1020220110210100122 |
4 | 130333323113120 |
5 | 1444022122110 |
6 | 120135452412 |
7 | 15025232321 |
oct | 3477732730 |
9 | 1226423318 |
10 | 486520280 |
11 | 22a69a984 |
12 | 116b27108 |
13 | 79a4572c |
14 | 48887448 |
15 | 2caa4255 |
hex | 1cffb5d8 |
486520280 has 64 divisors (see below), whose sum is σ = 1172232000. Its totient is φ = 181080064.
The previous prime is 486520267. The next prime is 486520319. The reversal of 486520280 is 82025684.
It is a self number, because there is not a number n which added to its sum of digits gives 486520280.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56501 + ... + 64539.
It is an arithmetic number, because the mean of its divisors is an integer number (18316125).
Almost surely, 2486520280 is an apocalyptic number.
486520280 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 486520280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (586116000).
486520280 is an abundant number, since it is smaller than the sum of its proper divisors (685711720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
486520280 is a wasteful number, since it uses less digits than its factorization.
486520280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8156 (or 8152 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 35.
The square root of 486520280 is about 22057.2047186401. The cubic root of 486520280 is about 786.5028777394.
The spelling of 486520280 in words is "four hundred eighty-six million, five hundred twenty thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •