The number 48328
48328 is a composite number with 16 divisors. Its prime factorisation is × 7 × 863. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 863, 1726, 3452, 6041, 6904, 12082, 24164, 48328.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48328 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48328 is composite. Its prime factorisation is
- 3
The divisors add up to 103680; without 48328 itself that is 55352, so 48328 is abundant (55352 is more than 48328). Euler's totient φ(48328) = 20688 numbers up to 48328 share no factor with it.
- 4
The digits of 48328 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48328 = 2^{3} \times 7 \times 863 \]48328 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 103680 |
| Euler totient φ(n) | 20688 |
| Square | 2335595584 |
| Cube | 112874663383552 |
| Square root | 219.836303 (= 2√12082) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8328 × |
48328 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and twenty-eight |
| Binary (base 2) | 1011110011001000 |
| Octal (base 8) | 136310 |
| Hexadecimal (base 16) | BCC8 |
| Base 3 | 2110021221 |
| As time | 48328 seconds = 13 h 25 min 28 s |
Is 48328 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48328 ÷ 2 = 24164) | 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 (48328 ÷ 4 = 12082) | 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 | Yes (48328 ÷ 7 = 6904) | 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 (48328 ÷ 8 = 6041) | 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 | No (remainder 5) | 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 48328 a prime number?
No. 48328 = × 7 × 863, so it is divisible by 2.
What are the factors of 48328?
1, 2, 4, 7, 8, 14, 28, 56, 863, 1726, 3452, 6041, 6904, 12082, 24164, 48328.
What is 48328 in binary?
1011110011001000 (hexadecimal BCC8, octal 136310).
What is the square root of 48328?
About 219.8363, exactly 2√12082.
Is 48328 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48328?
It is a composite number with 16 divisors.