The number 52059
52059 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 37 × 67. Divisors (16): 1, 3, 7, 21, 37, 67, 111, 201, 259, 469, 777, 1407, 2479, 7437, 17353, 52059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52059: a Harshad number: divisible by its digit sum 21.
- 2
52059 is composite. Its prime factorisation is
- 3
The divisors add up to 82688; without 52059 itself that is 30629, so 52059 is deficient (30629 is less than 52059). Euler's totient φ(52059) = 28512 numbers up to 52059 share no factor with it.
- 4
The digits of 52059 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52059 = 3 \times 7 \times 37 \times 67 \]
52059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 82688 |
| Euler totient φ(n) | 28512 |
| Square | 2710139481 |
| Cube | 141087151241379 |
| Square root | 228.164414 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.2059 × |
52059 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand and fifty-nine |
| Binary (base 2) | 1100101101011011 |
| Octal (base 8) | 145533 |
| Hexadecimal (base 16) | CB5B |
| Base 3 | 2122102010 |
| As time | 52059 seconds = 14 h 27 min 39 s |
Is 52059 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52059 ÷ 3 = 17353) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (52059 ÷ 7 = 7437) | 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 3) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52059 a prime number?
No. 52059 = 3 × 7 × 37 × 67, so it is divisible by 3.
What are the factors of 52059?
1, 3, 7, 21, 37, 67, 111, 201, 259, 469, 777, 1407, 2479, 7437, 17353, 52059.
What is 52059 in binary?
1100101101011011 (hexadecimal CB5B, octal 145533).
What is the square root of 52059?
About 228.1644.
Is 52059 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 52059?
52059 is a Harshad number: divisible by its digit sum 21.