The number 48752
48752 is a composite number with 20 divisors. Its prime factorisation is × 11 × 277. Divisors (20): 1, 2, 4, 8, 11, 16, 22, 44, 88, 176, 277, 554, 1108, 2216, 3047, 4432 … 48752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48752 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48752 is composite. Its prime factorisation is
- 3
The divisors add up to 103416; without 48752 itself that is 54664, so 48752 is abundant (54664 is more than 48752). Euler's totient φ(48752) = 22080 numbers up to 48752 share no factor with it.
- 4
The digits of 48752 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48752 = 2^{4} \times 11 \times 277 \]48752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 103416 |
| Euler totient φ(n) | 22080 |
| Square | 2376757504 |
| Cube | 115871681835008 |
| Square root | 220.798551 (= 4√3047) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8752 × |
48752 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand seven hundred and fifty-two |
| Binary (base 2) | 1011111001110000 |
| Octal (base 8) | 137160 |
| Hexadecimal (base 16) | BE70 |
| Base 3 | 2110212122 |
| As time | 48752 seconds = 13 h 32 min 32 s |
Is 48752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48752 ÷ 2 = 24376) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (48752 ÷ 4 = 12188) | 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 2) | 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 | Yes (48752 ÷ 8 = 6094) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | Yes (48752 ÷ 11 = 4432) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48752 a prime number?
No. 48752 = × 11 × 277, so it is divisible by 2.
What are the factors of 48752?
1, 2, 4, 8, 11, 16, 22, 44, 88, 176, 277, 554, 1108, 2216, 3047, 4432, 6094, 12188, 24376, 48752.
What is 48752 in binary?
1011111001110000 (hexadecimal BE70, octal 137160).
What is the square root of 48752?
About 220.7986, exactly 4√3047.
Is 48752 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 48752?
It is a composite number with 20 divisors.