The number 49732
49732 is a composite number with 6 divisors. Its prime factorisation is × 12433. Divisors (6): 1, 2, 4, 12433, 24866, 49732.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49732 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49732 is composite. Its prime factorisation is
- 3
The divisors add up to 87038; without 49732 itself that is 37306, so 49732 is deficient (37306 is less than 49732). Euler's totient φ(49732) = 24864 numbers up to 49732 share no factor with it.
- 4
The digits of 49732 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49732 = 2^{2} \times 12433 \]49732 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 87038 |
| Euler totient φ(n) | 24864 |
| Square | 2473271824 |
| Cube | 123000754351168 |
| Square root | 223.006726 (= 2√12433) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9732 × |
49732 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and thirty-two |
| Binary (base 2) | 1100001001000100 |
| Octal (base 8) | 141104 |
| Hexadecimal (base 16) | C244 |
| Base 3 | 2112012221 |
| As time | 49732 seconds = 13 h 48 min 52 s |
Is 49732 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49732 ÷ 2 = 24866) | 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 (49732 ÷ 4 = 12433) | 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 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 1) | 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 49732 a prime number?
No. 49732 = × 12433, so it is divisible by 2.
What are the factors of 49732?
1, 2, 4, 12433, 24866, 49732.
What is 49732 in binary?
1100001001000100 (hexadecimal C244, octal 141104).
What is the square root of 49732?
About 223.0067, exactly 2√12433.
Is 49732 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49732?
It is a composite number with 6 divisors.