The number 10978
10978 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 499. Divisors (8): 1, 2, 11, 22, 499, 998, 5489, 10978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10978 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10978 is composite. Its prime factorisation is
- 3
The divisors add up to 18000; without 10978 itself that is 7022, so 10978 is deficient (7022 is less than 10978). Euler's totient φ(10978) = 4980 numbers up to 10978 share no factor with it.
- 4
The digits of 10978 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10978 = 2 \times 11 \times 499 \]
10978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18000 |
| Euler totient φ(n) | 4980 |
| Square | 120516484 |
| Cube | 1323029961352 |
| Square root | 104.775951 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.0978 × |
10978 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and seventy-eight |
| Binary (base 2) | 10101011100010 |
| Octal (base 8) | 25342 |
| Hexadecimal (base 16) | 2AE2 |
| Base 3 | 120001121 |
| As time | 10978 seconds = 3 h 2 min 58 s |
Is 10978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10978 ÷ 2 = 5489) | 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 2) | 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 7) | 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 | Yes (10978 ÷ 11 = 998) | 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 10978 a prime number?
No. 10978 = 2 × 11 × 499, so it is divisible by 2.
What are the factors of 10978?
1, 2, 11, 22, 499, 998, 5489, 10978.
What is 10978 in binary?
10101011100010 (hexadecimal 2AE2, octal 25342).
What is the square root of 10978?
About 104.7760.
Is 10978 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 10978?
It is a composite number with 8 divisors.