The number 48904
48904 is a composite number with 8 divisors. Its prime factorisation is × 6113. Divisors (8): 1, 2, 4, 8, 6113, 12226, 24452, 48904.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48904 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48904 is composite. Its prime factorisation is
- 3
The divisors add up to 91710; without 48904 itself that is 42806, so 48904 is deficient (42806 is less than 48904). Euler's totient φ(48904) = 24448 numbers up to 48904 share no factor with it.
- 4
The digits of 48904 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48904 = 2^{3} \times 6113 \]48904 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91710 |
| Euler totient φ(n) | 24448 |
| Square | 2391601216 |
| Cube | 116958865867264 |
| Square root | 221.142488 (= 2√12226) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8904 × |
48904 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and four |
| Binary (base 2) | 1011111100001000 |
| Octal (base 8) | 137410 |
| Hexadecimal (base 16) | BF08 |
| Base 3 | 2111002021 |
| As time | 48904 seconds = 13 h 35 min 4 s |
Is 48904 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48904 ÷ 2 = 24452) | 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 | Yes (48904 ÷ 4 = 12226) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 | Yes (48904 ÷ 8 = 6113) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48904 a prime number?
No. 48904 = × 6113, so it is divisible by 2.
What are the factors of 48904?
1, 2, 4, 8, 6113, 12226, 24452, 48904.
What is 48904 in binary?
1011111100001000 (hexadecimal BF08, octal 137410).
What is the square root of 48904?
About 221.1425, exactly 2√12226.
Is 48904 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48904?
It is a composite number with 8 divisors.