The number 14680
14680 is a composite number with 16 divisors. Its prime factorisation is × 5 × 367. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 367, 734, 1468, 1835, 2936, 3670, 7340, 14680.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14680 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14680 is composite. Its prime factorisation is
- 3
The divisors add up to 33120; without 14680 itself that is 18440, so 14680 is abundant (18440 is more than 14680). Euler's totient φ(14680) = 5856 numbers up to 14680 share no factor with it.
- 4
The digits of 14680 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14680 = 2^{3} \times 5 \times 367 \]14680 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 33120 |
| Euler totient φ(n) | 5856 |
| Square | 215502400 |
| Cube | 3163575232000 |
| Square root | 121.161050 (= 2√3670) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.468 × |
14680 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and eighty |
| Binary (base 2) | 11100101011000 |
| Octal (base 8) | 34530 |
| Hexadecimal (base 16) | 3958 |
| Base 3 | 202010201 |
| As time | 14680 seconds = 4 h 4 min 40 s |
Is 14680 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14680 ÷ 2 = 7340) | 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 (14680 ÷ 4 = 3670) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14680 ÷ 5 = 2936) | 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 | 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 (14680 ÷ 8 = 1835) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14680 ÷ 10 = 1468) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14680 a prime number?
No. 14680 = × 5 × 367, so it is divisible by 2.
What are the factors of 14680?
1, 2, 4, 5, 8, 10, 20, 40, 367, 734, 1468, 1835, 2936, 3670, 7340, 14680.
What is 14680 in binary?
11100101011000 (hexadecimal 3958, octal 34530).
What is the square root of 14680?
About 121.1610, exactly 2√3670.
Is 14680 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14680?
It is a composite number with 16 divisors.