The number 14978
14978 is a composite number with 4 divisors. Its prime factorisation is 2 × 7489. Divisors (4): 1, 2, 7489, 14978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14978: a semiprime: 2 × 7489, the product of two primes.
- 2
14978 is composite. Its prime factorisation is
- 3
The divisors add up to 22470; without 14978 itself that is 7492, so 14978 is deficient (7492 is less than 14978). Euler's totient φ(14978) = 7488 numbers up to 14978 share no factor with it.
- 4
The digits of 14978 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14978 = 2 \times 7489 \]
14978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22470 |
| Euler totient φ(n) | 7488 |
| Square | 224340484 |
| Cube | 3360171769352 |
| Square root | 122.384640 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4978 × |
14978 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and seventy-eight |
| Binary (base 2) | 11101010000010 |
| Octal (base 8) | 35202 |
| Hexadecimal (base 16) | 3A82 |
| Base 3 | 202112202 |
| As time | 14978 seconds = 4 h 9 min 38 s |
Is 14978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14978 ÷ 2 = 7489) | 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 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 2) | 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 | No (remainder 8) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14978 a prime number?
No. 14978 = 2 × 7489, so it is divisible by 2.
What are the factors of 14978?
1, 2, 7489, 14978.
What is 14978 in binary?
11101010000010 (hexadecimal 3A82, octal 35202).
What is the square root of 14978?
About 122.3846.
Is 14978 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 14978?
14978 is a semiprime: 2 × 7489, the product of two primes.