The number 49752
49752 is a composite number with 24 divisors. Its prime factorisation is × × 691. Divisors (24): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 691, 1382, 2073, 2764 … 49752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49752 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49752 is composite. Its prime factorisation is
- 3
The divisors add up to 134940; without 49752 itself that is 85188, so 49752 is abundant (85188 is more than 49752). Euler's totient φ(49752) = 16560 numbers up to 49752 share no factor with it.
- 4
The digits of 49752 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49752 = 2^{3} \times 3^{2} \times 691 \]49752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 134940 |
| Euler totient φ(n) | 16560 |
| Square | 2475261504 |
| Cube | 123149210347008 |
| Square root | 223.051564 (= 6√1382) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9752 × |
49752 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and fifty-two |
| Binary (base 2) | 1100001001011000 |
| Octal (base 8) | 141130 |
| Hexadecimal (base 16) | C258 |
| Base 3 | 2112020200 |
| As time | 49752 seconds = 13 h 49 min 12 s |
Is 49752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49752 ÷ 2 = 24876) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49752 ÷ 3 = 16584) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49752 ÷ 4 = 12438) | 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 (49752 ÷ 6 = 8292) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (49752 ÷ 8 = 6219) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49752 ÷ 9 = 5528) | 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 | Yes (49752 ÷ 12 = 4146) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49752 a prime number?
No. 49752 = × × 691, so it is divisible by 2.
What are the factors of 49752?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 691, 1382, 2073, 2764, 4146, 5528, 6219, 8292, 12438, 16584, 24876, 49752.
What is 49752 in binary?
1100001001011000 (hexadecimal C258, octal 141130).
What is the square root of 49752?
About 223.0516, exactly 6√1382.
Is 49752 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49752?
It is a composite number with 24 divisors.