The number 14460
14460 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 241. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 241, 482, 723, 964 … 14460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14460: a Harshad number: divisible by its digit sum 15.
- 2
14460 is composite. Its prime factorisation is
- 3
The divisors add up to 40656; without 14460 itself that is 26196, so 14460 is abundant (26196 is more than 14460). Euler's totient φ(14460) = 3840 numbers up to 14460 share no factor with it.
- 4
The digits of 14460 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14460 = 2^{2} \times 3 \times 5 \times 241 \]14460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 40656 |
| Euler totient φ(n) | 3840 |
| Square | 209091600 |
| Cube | 3023464536000 |
| Square root | 120.249740 (= 2√3615) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.446 × |
14460 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and sixty |
| Binary (base 2) | 11100001111100 |
| Octal (base 8) | 34174 |
| Hexadecimal (base 16) | 387C |
| Base 3 | 201211120 |
| As time | 14460 seconds = 4 h 1 min 0 s |
Is 14460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14460 ÷ 2 = 7230) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14460 ÷ 3 = 4820) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14460 ÷ 4 = 3615) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14460 ÷ 5 = 2892) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14460 ÷ 6 = 2410) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14460 ÷ 10 = 1446) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (14460 ÷ 12 = 1205) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14460 a prime number?
No. 14460 = × 3 × 5 × 241, so it is divisible by 2.
What are the factors of 14460?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 241, 482, 723, 964, 1205, 1446, 2410, 2892, 3615, 4820, 7230, 14460.
What is 14460 in binary?
11100001111100 (hexadecimal 387C, octal 34174).
What is the square root of 14460?
About 120.2497, exactly 2√3615.
Is 14460 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14460?
14460 is a Harshad number: divisible by its digit sum 15.