The number 48352
48352 is a composite number with 12 divisors. Its prime factorisation is × 1511. Divisors (12): 1, 2, 4, 8, 16, 32, 1511, 3022, 6044, 12088, 24176, 48352.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48352 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48352 is composite. Its prime factorisation is
- 3
The divisors add up to 95256; without 48352 itself that is 46904, so 48352 is deficient (46904 is less than 48352). Euler's totient φ(48352) = 24160 numbers up to 48352 share no factor with it.
- 4
The digits of 48352 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48352 = 2^{5} \times 1511 \]48352 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 95256 |
| Euler totient φ(n) | 24160 |
| Square | 2337915904 |
| Cube | 113042909790208 |
| Square root | 219.890882 (= 4√3022) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.8352 × |
48352 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and fifty-two |
| Binary (base 2) | 1011110011100000 |
| Octal (base 8) | 136340 |
| Hexadecimal (base 16) | BCE0 |
| Base 3 | 2110022211 |
| As time | 48352 seconds = 13 h 25 min 52 s |
Is 48352 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48352 ÷ 2 = 24176) | 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 (48352 ÷ 4 = 12088) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | 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 (48352 ÷ 8 = 6044) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 48352 a prime number?
No. 48352 = × 1511, so it is divisible by 2.
What are the factors of 48352?
1, 2, 4, 8, 16, 32, 1511, 3022, 6044, 12088, 24176, 48352.
What is 48352 in binary?
1011110011100000 (hexadecimal BCE0, octal 136340).
What is the square root of 48352?
About 219.8909, exactly 4√3022.
Is 48352 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 48352?
It is a composite number with 12 divisors.