The number 48732
48732 is a composite number with 24 divisors. Its prime factorisation is × 3 × 31 × 131. Divisors (24): 1, 2, 3, 4, 6, 12, 31, 62, 93, 124, 131, 186, 262, 372, 393, 524 … 48732.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48732 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48732 is composite. Its prime factorisation is
- 3
The divisors add up to 118272; without 48732 itself that is 69540, so 48732 is abundant (69540 is more than 48732). Euler's totient φ(48732) = 15600 numbers up to 48732 share no factor with it.
- 4
The digits of 48732 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48732 = 2^{2} \times 3 \times 31 \times 131 \]48732 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 118272 |
| Euler totient φ(n) | 15600 |
| Square | 2374807824 |
| Cube | 115729134879168 |
| Square root | 220.753256 (= 2√12183) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.8732 × |
48732 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand seven hundred and thirty-two |
| Binary (base 2) | 1011111001011100 |
| Octal (base 8) | 137134 |
| Hexadecimal (base 16) | BE5C |
| Base 3 | 2110211220 |
| As time | 48732 seconds = 13 h 32 min 12 s |
Is 48732 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48732 ÷ 2 = 24366) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48732 ÷ 3 = 16244) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (48732 ÷ 4 = 12183) | 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 | Yes (48732 ÷ 6 = 8122) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (48732 ÷ 12 = 4061) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48732 a prime number?
No. 48732 = × 3 × 31 × 131, so it is divisible by 2.
What are the factors of 48732?
1, 2, 3, 4, 6, 12, 31, 62, 93, 124, 131, 186, 262, 372, 393, 524, 786, 1572, 4061, 8122, 12183, 16244, 24366, 48732.
What is 48732 in binary?
1011111001011100 (hexadecimal BE5C, octal 137134).
What is the square root of 48732?
About 220.7533, exactly 2√12183.
Is 48732 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 48732?
It is a composite number with 24 divisors.