The number 14560
14560 is a composite number with 48 divisors. Its prime factorisation is × 5 × 7 × 13. Divisors (48): 1, 2, 4, 5, 7, 8, 10, 13, 14, 16, 20, 26, 28, 32, 35, 40 … 14560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14560: a Harshad number: divisible by its digit sum 16.
- 2
14560 is composite. Its prime factorisation is
- 3
The divisors add up to 42336; without 14560 itself that is 27776, so 14560 is abundant (27776 is more than 14560). Euler's totient φ(14560) = 4608 numbers up to 14560 share no factor with it.
- 4
The digits of 14560 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14560 = 2^{5} \times 5 \times 7 \times 13 \]14560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 42336 |
| Euler totient φ(n) | 4608 |
| Square | 211993600 |
| Cube | 3086626816000 |
| Square root | 120.664825 (= 4√910) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.456 × |
14560 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and sixty |
| Binary (base 2) | 11100011100000 |
| Octal (base 8) | 34340 |
| Hexadecimal (base 16) | 38E0 |
| Base 3 | 201222021 |
| As time | 14560 seconds = 4 h 2 min 40 s |
Is 14560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14560 ÷ 2 = 7280) | 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 (14560 ÷ 4 = 3640) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14560 ÷ 5 = 2912) | 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 (14560 ÷ 7 = 2080) | 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 (14560 ÷ 8 = 1820) | 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 (14560 ÷ 10 = 1456) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 14560 a prime number?
No. 14560 = × 5 × 7 × 13, so it is divisible by 2.
What are the factors of 14560?
1, 2, 4, 5, 7, 8, 10, 13, 14, 16, 20, 26, 28, 32, 35, 40, 52, 56, 65, 70, 80, 91, 104, 112, 130, 140, 160, 182, 208, 224, 260, 280, 364, 416, 455, 520, 560, 728, 910, 1040, 1120, 1456, 1820, 2080, 2912, 3640, 7280, 14560.
What is 14560 in binary?
11100011100000 (hexadecimal 38E0, octal 34340).
What is the square root of 14560?
About 120.6648, exactly 4√910.
Is 14560 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 14560?
14560 is a Harshad number: divisible by its digit sum 16.