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