The number 14640
14640 is a composite number with 40 divisors. Its prime factorisation is × 3 × 5 × 61. Divisors (40): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 40, 48 … 14640.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14640: a Harshad number: divisible by its digit sum 15.
- 2
14640 is composite. Its prime factorisation is
- 3
The divisors add up to 46128; without 14640 itself that is 31488, so 14640 is abundant (31488 is more than 14640). Euler's totient φ(14640) = 3840 numbers up to 14640 share no factor with it.
- 4
The digits of 14640 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14640 = 2^{4} \times 3 \times 5 \times 61 \]14640 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 46128 |
| Euler totient φ(n) | 3840 |
| Square | 214329600 |
| Cube | 3137785344000 |
| Square root | 120.995868 (= 4√915) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.464 × |
14640 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and forty |
| Binary (base 2) | 11100100110000 |
| Octal (base 8) | 34460 |
| Hexadecimal (base 16) | 3930 |
| Base 3 | 202002020 |
| As time | 14640 seconds = 4 h 4 min 0 s |
Is 14640 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14640 ÷ 2 = 7320) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14640 ÷ 3 = 4880) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14640 ÷ 4 = 3660) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14640 ÷ 5 = 2928) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14640 ÷ 6 = 2440) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (14640 ÷ 8 = 1830) | 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 (14640 ÷ 10 = 1464) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (14640 ÷ 12 = 1220) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14640 a prime number?
No. 14640 = × 3 × 5 × 61, so it is divisible by 2.
What are the factors of 14640?
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 40, 48, 60, 61, 80, 120, 122, 183, 240, 244, 305, 366, 488, 610, 732, 915, 976, 1220, 1464, 1830, 2440, 2928, 3660, 4880, 7320, 14640.
What is 14640 in binary?
11100100110000 (hexadecimal 3930, octal 34460).
What is the square root of 14640?
About 120.9959, exactly 4√915.
Is 14640 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14640?
14640 is a Harshad number: divisible by its digit sum 15.