The number 49532
49532 is a composite number with 24 divisors. Its prime factorisation is × 7 × 29 × 61. Divisors (24): 1, 2, 4, 7, 14, 28, 29, 58, 61, 116, 122, 203, 244, 406, 427, 812 … 49532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49532 is composite. Its prime factorisation is
- 3
The divisors add up to 104160; without 49532 itself that is 54628, so 49532 is abundant (54628 is more than 49532). Euler's totient φ(49532) = 20160 numbers up to 49532 share no factor with it.
- 4
The digits of 49532 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49532 = 2^{2} \times 7 \times 29 \times 61 \]49532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 104160 |
| Euler totient φ(n) | 20160 |
| Square | 2453419024 |
| Cube | 121522751096768 |
| Square root | 222.557858 (= 2√12383) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 171 |
| Scientific notation | 4.9532 × |
49532 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and thirty-two |
| Binary (base 2) | 1100000101111100 |
| Octal (base 8) | 140574 |
| Hexadecimal (base 16) | C17C |
| Base 3 | 2111221112 |
| As time | 49532 seconds = 13 h 45 min 32 s |
Is 49532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49532 ÷ 2 = 24766) | 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 (49532 ÷ 4 = 12383) | 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 | Yes (49532 ÷ 7 = 7076) | 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 5) | 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 10) | 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 49532 a prime number?
No. 49532 = × 7 × 29 × 61, so it is divisible by 2.
What are the factors of 49532?
1, 2, 4, 7, 14, 28, 29, 58, 61, 116, 122, 203, 244, 406, 427, 812, 854, 1708, 1769, 3538, 7076, 12383, 24766, 49532.
What is 49532 in binary?
1100000101111100 (hexadecimal C17C, octal 140574).
What is the square root of 49532?
About 222.5579, exactly 2√12383.
Is 49532 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49532?
It is a composite number with 24 divisors.