The number 49572
49572 is a composite number with 42 divisors. Its prime factorisation is × × 17. Divisors (42): 1, 2, 3, 4, 6, 9, 12, 17, 18, 27, 34, 36, 51, 54, 68, 81 … 49572.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49572: a Harshad number: divisible by its digit sum 27.
- 2
49572 is composite. Its prime factorisation is
- 3
The divisors add up to 137718; without 49572 itself that is 88146, so 49572 is abundant (88146 is more than 49572). Euler's totient φ(49572) = 15552 numbers up to 49572 share no factor with it.
- 4
The digits of 49572 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49572 = 2^{2} \times 3^{6} \times 17 \]49572 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 42 |
| Sum of divisors | 137718 |
| Euler totient φ(n) | 15552 |
| Square | 2457383184 |
| Cube | 121817399197248 |
| Square root | 222.647704 (= 54√17) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9572 × |
49572 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and seventy-two |
| Binary (base 2) | 1100000110100100 |
| Octal (base 8) | 140644 |
| Hexadecimal (base 16) | C1A4 |
| Base 3 | 2112000000 |
| As time | 49572 seconds = 13 h 46 min 12 s |
Is 49572 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49572 ÷ 2 = 24786) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49572 ÷ 3 = 16524) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49572 ÷ 4 = 12393) | 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 (49572 ÷ 6 = 8262) | 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 | Yes (49572 ÷ 9 = 5508) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (49572 ÷ 12 = 4131) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49572 a prime number?
No. 49572 = × × 17, so it is divisible by 2.
What are the factors of 49572?
1, 2, 3, 4, 6, 9, 12, 17, 18, 27, 34, 36, 51, 54, 68, 81, 102, 108, 153, 162, 204, 243, 306, 324, 459, 486, 612, 729, 918, 972, 1377, 1458, 1836, 2754, 2916, 4131, 5508, 8262, 12393, 16524, 24786, 49572.
What is 49572 in binary?
1100000110100100 (hexadecimal C1A4, octal 140644).
What is the square root of 49572?
About 222.6477, exactly 54√17.
Is 49572 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49572?
49572 is a Harshad number: divisible by its digit sum 27.