Base | Representation |
---|---|
bin | 11100110001100… |
… | …011110101011000 |
3 | 1020122101102211100 |
4 | 130301203311120 |
5 | 1442041111010 |
6 | 115523031400 |
7 | 14651224500 |
oct | 3461436530 |
9 | 1218342740 |
10 | 482753880 |
11 | 228558154 |
12 | 11580b560 |
13 | 790272ab |
14 | 48186a00 |
15 | 2c5ad2c0 |
hex | 1cc63d58 |
482753880 has 144 divisors (see below), whose sum is σ = 1825171920. Its totient is φ = 110339712.
The previous prime is 482753857. The next prime is 482753897. The reversal of 482753880 is 88357284.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 3957 + ... + 31323.
It is an arithmetic number, because the mean of its divisors is an integer number (12674805).
Almost surely, 2482753880 is an apocalyptic number.
482753880 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 482753880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (912585960).
482753880 is an abundant number, since it is smaller than the sum of its proper divisors (1342418040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
482753880 is a wasteful number, since it uses less digits than its factorization.
482753880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27398 (or 27384 counting only the distinct ones).
The product of its (nonzero) digits is 430080, while the sum is 45.
The square root of 482753880 is about 21971.6608384528. The cubic root of 482753880 is about 784.4680453528.
The spelling of 482753880 in words is "four hundred eighty-two million, seven hundred fifty-three thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •