The number 52569
52569 is a composite number with 20 divisors. Its prime factorisation is × 11 × 59. Divisors (20): 1, 3, 9, 11, 27, 33, 59, 81, 99, 177, 297, 531, 649, 891, 1593, 1947 … 52569.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52569: a Harshad number: divisible by its digit sum 27.
- 2
52569 is composite. Its prime factorisation is
- 3
The divisors add up to 87120; without 52569 itself that is 34551, so 52569 is deficient (34551 is less than 52569). Euler's totient φ(52569) = 31320 numbers up to 52569 share no factor with it.
- 4
The digits of 52569 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
\[ 52569 = 3^{4} \times 11 \times 59 \]52569 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 87120 |
| Euler totient φ(n) | 31320 |
| Square | 2763499761 |
| Cube | 145274418936009 |
| Square root | 229.279306 (= 9√649) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.2569 × |
52569 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and sixty-nine |
| Binary (base 2) | 1100110101011001 |
| Octal (base 8) | 146531 |
| Hexadecimal (base 16) | CD59 |
| Base 3 | 2200010000 |
| As time | 52569 seconds = 14 h 36 min 9 s |
Is 52569 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 (52569 ÷ 3 = 17523) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 | No (remainder 6) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (52569 ÷ 9 = 5841) | 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 | Yes (52569 ÷ 11 = 4779) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52569 a prime number?
No. 52569 = × 11 × 59, so it is divisible by 3.
What are the factors of 52569?
1, 3, 9, 11, 27, 33, 59, 81, 99, 177, 297, 531, 649, 891, 1593, 1947, 4779, 5841, 17523, 52569.
What is 52569 in binary?
1100110101011001 (hexadecimal CD59, octal 146531).
What is the square root of 52569?
About 229.2793, exactly 9√649.
Is 52569 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 52569?
52569 is a Harshad number: divisible by its digit sum 27.