The number 14678
14678 is a composite number with 8 divisors. Its prime factorisation is 2 × 41 × 179. Divisors (8): 1, 2, 41, 82, 179, 358, 7339, 14678.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14678 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14678 is composite. Its prime factorisation is
- 3
The divisors add up to 22680; without 14678 itself that is 8002, so 14678 is deficient (8002 is less than 14678). Euler's totient φ(14678) = 7120 numbers up to 14678 share no factor with it.
- 4
The digits of 14678 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14678 = 2 \times 41 \times 179 \]
14678 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22680 |
| Euler totient φ(n) | 7120 |
| Square | 215443684 |
| Cube | 3162282393752 |
| Square root | 121.152796 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 195 |
| Scientific notation | 1.4678 × |
14678 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and seventy-eight |
| Binary (base 2) | 11100101010110 |
| Octal (base 8) | 34526 |
| Hexadecimal (base 16) | 3956 |
| Base 3 | 202010122 |
| As time | 14678 seconds = 4 h 4 min 38 s |
Is 14678 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14678 ÷ 2 = 7339) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 6) | 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 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14678 a prime number?
No. 14678 = 2 × 41 × 179, so it is divisible by 2.
What are the factors of 14678?
1, 2, 41, 82, 179, 358, 7339, 14678.
What is 14678 in binary?
11100101010110 (hexadecimal 3956, octal 34526).
What is the square root of 14678?
About 121.1528.
Is 14678 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 14678?
It is a composite number with 8 divisors.