The number 48978
48978 is a composite number with 16 divisors. Its prime factorisation is 2 × × 907. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 54, 907, 1814, 2721, 5442, 8163, 16326, 24489, 48978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48978 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48978 is composite. Its prime factorisation is
- 3
The divisors add up to 108960; without 48978 itself that is 59982, so 48978 is abundant (59982 is more than 48978). Euler's totient φ(48978) = 16308 numbers up to 48978 share no factor with it.
- 4
The digits of 48978 add up to 36, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48978 = 2 \times 3^{3} \times 907 \]48978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 108960 |
| Euler totient φ(n) | 16308 |
| Square | 2398844484 |
| Cube | 117490605137352 |
| Square root | 221.309738 (= 3√5442) |
| Digit sum / digital root | 36 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8978 × |
48978 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and seventy-eight |
| Binary (base 2) | 1011111101010010 |
| Octal (base 8) | 137522 |
| Hexadecimal (base 16) | BF52 |
| Base 3 | 2111012000 |
| As time | 48978 seconds = 13 h 36 min 18 s |
Is 48978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48978 ÷ 2 = 24489) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48978 ÷ 3 = 16326) | 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 | Yes (48978 ÷ 6 = 8163) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48978 ÷ 9 = 5442) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48978 a prime number?
No. 48978 = 2 × × 907, so it is divisible by 2.
What are the factors of 48978?
1, 2, 3, 6, 9, 18, 27, 54, 907, 1814, 2721, 5442, 8163, 16326, 24489, 48978.
What is 48978 in binary?
1011111101010010 (hexadecimal BF52, octal 137522).
What is the square root of 48978?
About 221.3097, exactly 3√5442.
Is 48978 divisible by 3?
Yes. Its digits add up to 36, a multiple of 3.
What is special about the number 48978?
It is a composite number with 16 divisors.