The number 16978
16978 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 653. Divisors (8): 1, 2, 13, 26, 653, 1306, 8489, 16978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16978 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16978 is composite. Its prime factorisation is
- 3
The divisors add up to 27468; without 16978 itself that is 10490, so 16978 is deficient (10490 is less than 16978). Euler's totient φ(16978) = 7824 numbers up to 16978 share no factor with it.
- 4
The digits of 16978 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16978 = 2 \times 13 \times 653 \]
16978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 27468 |
| Euler totient φ(n) | 7824 |
| Square | 288252484 |
| Cube | 4893950673352 |
| Square root | 130.299655 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 66 |
| Scientific notation | 1.6978 × |
16978 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and seventy-eight |
| Binary (base 2) | 100001001010010 |
| Octal (base 8) | 41122 |
| Hexadecimal (base 16) | 4252 |
| Base 3 | 212021211 |
| As time | 16978 seconds = 4 h 42 min 58 s |
Is 16978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16978 ÷ 2 = 8489) | 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 | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16978 a prime number?
No. 16978 = 2 × 13 × 653, so it is divisible by 2.
What are the factors of 16978?
1, 2, 13, 26, 653, 1306, 8489, 16978.
What is 16978 in binary?
100001001010010 (hexadecimal 4252, octal 41122).
What is the square root of 16978?
About 130.2997.
Is 16978 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 16978?
It is a composite number with 8 divisors.