Base | Representation |
---|---|
bin | 10001000101111100100000 |
3 | 22102122111120 |
4 | 101011330200 |
5 | 2121341200 |
6 | 240012240 |
7 | 53041362 |
oct | 21057440 |
9 | 8378446 |
10 | 4480800 |
11 | 2590545 |
12 | 1601080 |
13 | c0b67c |
14 | 848d32 |
15 | 5d79a0 |
hex | 445f20 |
4480800 has 72 divisors (see below), whose sum is σ = 14592816. Its totient is φ = 1194240.
The previous prime is 4480799. The next prime is 4480807. The reversal of 4480800 is 80844.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is not an unprimeable number, because it can be changed into a prime (4480807) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1467 + ... + 3333.
It is an arithmetic number, because the mean of its divisors is an integer number (202678).
Almost surely, 24480800 is an apocalyptic number.
4480800 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 4480800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7296408).
4480800 is an abundant number, since it is smaller than the sum of its proper divisors (10112016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4480800 is a wasteful number, since it uses less digits than its factorization.
4480800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1890 (or 1877 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 24.
The square root of 4480800 is about 2116.7900226522. The cubic root of 4480800 is about 164.8612239924.
The spelling of 4480800 in words is "four million, four hundred eighty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •