The number 49632
49632 is a composite number with 48 divisors. Its prime factorisation is × 3 × 11 × 47. Divisors (48): 1, 2, 3, 4, 6, 8, 11, 12, 16, 22, 24, 32, 33, 44, 47, 48 … 49632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49632: a Harshad number: divisible by its digit sum 24.
- 2
49632 is composite. Its prime factorisation is
- 3
The divisors add up to 145152; without 49632 itself that is 95520, so 49632 is abundant (95520 is more than 49632). Euler's totient φ(49632) = 14720 numbers up to 49632 share no factor with it.
- 4
The digits of 49632 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49632 = 2^{5} \times 3 \times 11 \times 47 \]49632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 145152 |
| Euler totient φ(n) | 14720 |
| Square | 2463335424 |
| Cube | 122260263763968 |
| Square root | 222.782405 (= 4√3102) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9632 × |
49632 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and thirty-two |
| Binary (base 2) | 1100000111100000 |
| Octal (base 8) | 140740 |
| Hexadecimal (base 16) | C1E0 |
| Base 3 | 2112002020 |
| As time | 49632 seconds = 13 h 47 min 12 s |
Is 49632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49632 ÷ 2 = 24816) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49632 ÷ 3 = 16544) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49632 ÷ 4 = 12408) | 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 (49632 ÷ 6 = 8272) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (49632 ÷ 8 = 6204) | 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 | Yes (49632 ÷ 11 = 4512) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (49632 ÷ 12 = 4136) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49632 a prime number?
No. 49632 = × 3 × 11 × 47, so it is divisible by 2.
What are the factors of 49632?
1, 2, 3, 4, 6, 8, 11, 12, 16, 22, 24, 32, 33, 44, 47, 48, 66, 88, 94, 96, 132, 141, 176, 188, 264, 282, 352, 376, 517, 528, 564, 752, 1034, 1056, 1128, 1504, 1551, 2068, 2256, 3102, 4136, 4512, 6204, 8272, 12408, 16544, 24816, 49632.
What is 49632 in binary?
1100000111100000 (hexadecimal C1E0, octal 140740).
What is the square root of 49632?
About 222.7824, exactly 4√3102.
Is 49632 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49632?
49632 is a Harshad number: divisible by its digit sum 24.