The number 53205
53205 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3547. Divisors (8): 1, 3, 5, 15, 3547, 10641, 17735, 53205.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53205: a Harshad number: divisible by its digit sum 15.
- 2
53205 is composite. Its prime factorisation is
- 3
The divisors add up to 85152; without 53205 itself that is 31947, so 53205 is deficient (31947 is less than 53205). Euler's totient φ(53205) = 28368 numbers up to 53205 share no factor with it.
- 4
The digits of 53205 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53205 = 3 \times 5 \times 3547 \]
53205 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 85152 |
| Euler totient φ(n) | 28368 |
| Square | 2830772025 |
| Cube | 150611225590125 |
| Square root | 230.662091 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.3205 × |
53205 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand two hundred and five |
| Binary (base 2) | 1100111111010101 |
| Octal (base 8) | 147725 |
| Hexadecimal (base 16) | CFD5 |
| Base 3 | 2200222120 |
| As time | 53205 seconds = 14 h 46 min 45 s |
Is 53205 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 (53205 ÷ 3 = 17735) | 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 | Yes (53205 ÷ 5 = 10641) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 53205 a prime number?
No. 53205 = 3 × 5 × 3547, so it is divisible by 3.
What are the factors of 53205?
1, 3, 5, 15, 3547, 10641, 17735, 53205.
What is 53205 in binary?
1100111111010101 (hexadecimal CFD5, octal 147725).
What is the square root of 53205?
About 230.6621.
Is 53205 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 53205?
53205 is a Harshad number: divisible by its digit sum 15.