The number 14670
14670 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 163. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 163, 326, 489, 815 … 14670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14670: a Harshad number: divisible by its digit sum 18.
- 2
14670 is composite. Its prime factorisation is
- 3
The divisors add up to 38376; without 14670 itself that is 23706, so 14670 is abundant (23706 is more than 14670). Euler's totient φ(14670) = 3888 numbers up to 14670 share no factor with it.
- 4
The digits of 14670 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14670 = 2 \times 3^{2} \times 5 \times 163 \]14670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 38376 |
| Euler totient φ(n) | 3888 |
| Square | 215208900 |
| Cube | 3157114563000 |
| Square root | 121.119775 (= 3√1630) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.467 × |
14670 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and seventy |
| Binary (base 2) | 11100101001110 |
| Octal (base 8) | 34516 |
| Hexadecimal (base 16) | 394E |
| Base 3 | 202010100 |
| As time | 14670 seconds = 4 h 4 min 30 s |
Is 14670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14670 ÷ 2 = 7335) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14670 ÷ 3 = 4890) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14670 ÷ 5 = 2934) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14670 ÷ 6 = 2445) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14670 ÷ 9 = 1630) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14670 ÷ 10 = 1467) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14670 a prime number?
No. 14670 = 2 × × 5 × 163, so it is divisible by 2.
What are the factors of 14670?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 163, 326, 489, 815, 978, 1467, 1630, 2445, 2934, 4890, 7335, 14670.
What is 14670 in binary?
11100101001110 (hexadecimal 394E, octal 34516).
What is the square root of 14670?
About 121.1198, exactly 3√1630.
Is 14670 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14670?
14670 is a Harshad number: divisible by its digit sum 18.