The number 48948
48948 is a composite number with 12 divisors. Its prime factorisation is × 3 × 4079. Divisors (12): 1, 2, 3, 4, 6, 12, 4079, 8158, 12237, 16316, 24474, 48948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48948 is composite. Its prime factorisation is
- 3
The divisors add up to 114240; without 48948 itself that is 65292, so 48948 is abundant (65292 is more than 48948). Euler's totient φ(48948) = 16312 numbers up to 48948 share no factor with it.
- 4
The digits of 48948 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48948 = 2^{2} \times 3 \times 4079 \]48948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 114240 |
| Euler totient φ(n) | 16312 |
| Square | 2395906704 |
| Cube | 117274841347392 |
| Square root | 221.241949 (= 2√12237) |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8948 × |
48948 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and forty-eight |
| Binary (base 2) | 1011111100110100 |
| Octal (base 8) | 137464 |
| Hexadecimal (base 16) | BF34 |
| Base 3 | 2111010220 |
| As time | 48948 seconds = 13 h 35 min 48 s |
Is 48948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48948 ÷ 2 = 24474) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48948 ÷ 3 = 16316) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (48948 ÷ 4 = 12237) | 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 (48948 ÷ 6 = 8158) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (48948 ÷ 12 = 4079) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48948 a prime number?
No. 48948 = × 3 × 4079, so it is divisible by 2.
What are the factors of 48948?
1, 2, 3, 4, 6, 12, 4079, 8158, 12237, 16316, 24474, 48948.
What is 48948 in binary?
1011111100110100 (hexadecimal BF34, octal 137464).
What is the square root of 48948?
About 221.2419, exactly 2√12237.
Is 48948 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 48948?
It is a composite number with 12 divisors.