The number 4480
4480 is a composite number with 32 divisors. Its prime factorisation is × 5 × 7. Divisors (32): 1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 32, 35, 40, 56, 64 … 4480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4480: a Harshad number: divisible by its digit sum 16.
- 2
4480 is composite. Its prime factorisation is
- 3
The divisors add up to 12240; without 4480 itself that is 7760, so 4480 is abundant (7760 is more than 4480). Euler's totient φ(4480) = 1536 numbers up to 4480 share no factor with it.
- 4
The digits of 4480 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 20 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4480 = 2^{7} \times 5 \times 7 \]4480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 12240 |
| Euler totient φ(n) | 1536 |
| Square | 20070400 |
| Cube | 89915392000 |
| Square root | 66.932802 (= 8√70) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 20 |
| Scientific notation | 4.48 × |
4480 in other forms
| Form | Value |
|---|---|
| In words | four thousand four hundred and eighty |
| Binary (base 2) | 1000110000000 |
| Octal (base 8) | 10600 |
| Hexadecimal (base 16) | 1180 |
| Base 3 | 20010221 |
| As time | 4480 seconds = 1 h 14 min 40 s |
Is 4480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4480 ÷ 2 = 2240) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (4480 ÷ 4 = 1120) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (4480 ÷ 5 = 896) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (4480 ÷ 7 = 640) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | Yes (4480 ÷ 8 = 560) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (4480 ÷ 10 = 448) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4480 a prime number?
No. 4480 = × 5 × 7, so it is divisible by 2.
What are the factors of 4480?
1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 32, 35, 40, 56, 64, 70, 80, 112, 128, 140, 160, 224, 280, 320, 448, 560, 640, 896, 1120, 2240, 4480.
What is 4480 in binary?
1000110000000 (hexadecimal 1180, octal 10600).
What is the square root of 4480?
About 66.9328, exactly 8√70.
Is 4480 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 4480?
4480 is a Harshad number: divisible by its digit sum 16.