The number 14960
14960 is a composite number with 40 divisors. Its prime factorisation is × 5 × 11 × 17. Divisors (40): 1, 2, 4, 5, 8, 10, 11, 16, 17, 20, 22, 34, 40, 44, 55, 68 … 14960.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14960: a Harshad number: divisible by its digit sum 20.
- 2
14960 is composite. Its prime factorisation is
- 3
The divisors add up to 40176; without 14960 itself that is 25216, so 14960 is abundant (25216 is more than 14960). Euler's totient φ(14960) = 5120 numbers up to 14960 share no factor with it.
- 4
The digits of 14960 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14960 = 2^{4} \times 5 \times 11 \times 17 \]14960 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 40176 |
| Euler totient φ(n) | 5120 |
| Square | 223801600 |
| Cube | 3348071936000 |
| Square root | 122.311079 (= 4√935) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.496 × |
14960 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and sixty |
| Binary (base 2) | 11101001110000 |
| Octal (base 8) | 35160 |
| Hexadecimal (base 16) | 3A70 |
| Base 3 | 202112002 |
| As time | 14960 seconds = 4 h 9 min 20 s |
Is 14960 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14960 ÷ 2 = 7480) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14960 ÷ 4 = 3740) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14960 ÷ 5 = 2992) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (14960 ÷ 8 = 1870) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14960 ÷ 10 = 1496) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (14960 ÷ 11 = 1360) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14960 a prime number?
No. 14960 = × 5 × 11 × 17, so it is divisible by 2.
What are the factors of 14960?
1, 2, 4, 5, 8, 10, 11, 16, 17, 20, 22, 34, 40, 44, 55, 68, 80, 85, 88, 110, 136, 170, 176, 187, 220, 272, 340, 374, 440, 680, 748, 880, 935, 1360, 1496, 1870, 2992, 3740, 7480, 14960.
What is 14960 in binary?
11101001110000 (hexadecimal 3A70, octal 35160).
What is the square root of 14960?
About 122.3111, exactly 4√935.
Is 14960 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14960?
14960 is a Harshad number: divisible by its digit sum 20.