The number 53601
53601 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 1051. Divisors (8): 1, 3, 17, 51, 1051, 3153, 17867, 53601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53601 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53601 is composite. Its prime factorisation is
- 3
The divisors add up to 75744; without 53601 itself that is 22143, so 53601 is deficient (22143 is less than 53601). Euler's totient φ(53601) = 33600 numbers up to 53601 share no factor with it.
- 4
The digits of 53601 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53601 = 3 \times 17 \times 1051 \]
53601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75744 |
| Euler totient φ(n) | 33600 |
| Square | 2873067201 |
| Cube | 153999275040801 |
| Square root | 231.518898 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3601 × |
53601 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand six hundred and one |
| Binary (base 2) | 1101000101100001 |
| Octal (base 8) | 150541 |
| Hexadecimal (base 16) | D161 |
| Base 3 | 2201112020 |
| As time | 53601 seconds = 14 h 53 min 21 s |
Is 53601 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 (53601 ÷ 3 = 17867) | 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 1) | 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 2) | 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 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 53601 a prime number?
No. 53601 = 3 × 17 × 1051, so it is divisible by 3.
What are the factors of 53601?
1, 3, 17, 51, 1051, 3153, 17867, 53601.
What is 53601 in binary?
1101000101100001 (hexadecimal D161, octal 150541).
What is the square root of 53601?
About 231.5189.
Is 53601 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 53601?
It is a composite number with 8 divisors.