The number 59052
59052 is a composite number with 48 divisors. Its prime factorisation is × 3 × 7 × 19 × 37. Divisors (48): 1, 2, 3, 4, 6, 7, 12, 14, 19, 21, 28, 37, 38, 42, 57, 74 … 59052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59052: a Harshad number: divisible by its digit sum 21.
- 2
59052 is composite. Its prime factorisation is
- 3
The divisors add up to 170240; without 59052 itself that is 111188, so 59052 is abundant (111188 is more than 59052). Euler's totient φ(59052) = 15552 numbers up to 59052 share no factor with it.
- 4
The digits of 59052 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59052 = 2^{2} \times 3 \times 7 \times 19 \times 37 \]59052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 170240 |
| Euler totient φ(n) | 15552 |
| Square | 3487138704 |
| Cube | 205922514748608 |
| Square root | 243.006173 (= 2√14763) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9052 × |
59052 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and fifty-two |
| Binary (base 2) | 1110011010101100 |
| Octal (base 8) | 163254 |
| Hexadecimal (base 16) | E6AC |
| Base 3 | 10000000010 |
| As time | 59052 seconds = 16 h 24 min 12 s |
Is 59052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59052 ÷ 2 = 29526) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59052 ÷ 3 = 19684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (59052 ÷ 4 = 14763) | 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 (59052 ÷ 6 = 9842) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (59052 ÷ 7 = 8436) | 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 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (59052 ÷ 12 = 4921) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59052 a prime number?
No. 59052 = × 3 × 7 × 19 × 37, so it is divisible by 2.
What are the factors of 59052?
1, 2, 3, 4, 6, 7, 12, 14, 19, 21, 28, 37, 38, 42, 57, 74, 76, 84, 111, 114, 133, 148, 222, 228, 259, 266, 399, 444, 518, 532, 703, 777, 798, 1036, 1406, 1554, 1596, 2109, 2812, 3108, 4218, 4921, 8436, 9842, 14763, 19684, 29526, 59052.
What is 59052 in binary?
1110011010101100 (hexadecimal E6AC, octal 163254).
What is the square root of 59052?
About 243.0062, exactly 2√14763.
Is 59052 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 59052?
59052 is a Harshad number: divisible by its digit sum 21.