The number 48532
48532 is a composite number with 12 divisors. Its prime factorisation is × 11 × 1103. Divisors (12): 1, 2, 4, 11, 22, 44, 1103, 2206, 4412, 12133, 24266, 48532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48532: a Harshad number: divisible by its digit sum 22.
- 2
48532 is composite. Its prime factorisation is
- 3
The divisors add up to 92736; without 48532 itself that is 44204, so 48532 is deficient (44204 is less than 48532). Euler's totient φ(48532) = 22040 numbers up to 48532 share no factor with it.
- 4
The digits of 48532 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 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48532 = 2^{2} \times 11 \times 1103 \]48532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 92736 |
| Euler totient φ(n) | 22040 |
| Square | 2355355024 |
| Cube | 114310090024768 |
| Square root | 220.299796 (= 2√12133) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 26 |
| Scientific notation | 4.8532 × |
48532 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and thirty-two |
| Binary (base 2) | 1011110110010100 |
| Octal (base 8) | 136624 |
| Hexadecimal (base 16) | BD94 |
| Base 3 | 2110120111 |
| As time | 48532 seconds = 13 h 28 min 52 s |
Is 48532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48532 ÷ 2 = 24266) | 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 (48532 ÷ 4 = 12133) | 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 1) | 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 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 | Yes (48532 ÷ 11 = 4412) | 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 48532 a prime number?
No. 48532 = × 11 × 1103, so it is divisible by 2.
What are the factors of 48532?
1, 2, 4, 11, 22, 44, 1103, 2206, 4412, 12133, 24266, 48532.
What is 48532 in binary?
1011110110010100 (hexadecimal BD94, octal 136624).
What is the square root of 48532?
About 220.2998, exactly 2√12133.
Is 48532 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 48532?
48532 is a Harshad number: divisible by its digit sum 22.