The number 59601
59601 is a composite number with 4 divisors. Its prime factorisation is 3 × 19867. Divisors (4): 1, 3, 19867, 59601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59601: a semiprime: 3 × 19867, the product of two primes.
- 2
59601 is composite. Its prime factorisation is
- 3
The divisors add up to 79472; without 59601 itself that is 19871, so 59601 is deficient (19871 is less than 59601). Euler's totient φ(59601) = 39732 numbers up to 59601 share no factor with it.
- 4
The digits of 59601 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59601 = 3 \times 19867 \]
59601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 79472 |
| Euler totient φ(n) | 39732 |
| Square | 3552279201 |
| Cube | 211719392658801 |
| Square root | 244.133160 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.9601 × |
59601 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand six hundred and one |
| Binary (base 2) | 1110100011010001 |
| Octal (base 8) | 164321 |
| Hexadecimal (base 16) | E8D1 |
| Base 3 | 10000202110 |
| As time | 59601 seconds = 16 h 33 min 21 s |
Is 59601 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 (59601 ÷ 3 = 19867) | 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 3) | 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 3) | 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 3) | 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 59601 a prime number?
No. 59601 = 3 × 19867, so it is divisible by 3.
What are the factors of 59601?
1, 3, 19867, 59601.
What is 59601 in binary?
1110100011010001 (hexadecimal E8D1, octal 164321).
What is the square root of 59601?
About 244.1332.
Is 59601 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 59601?
59601 is a semiprime: 3 × 19867, the product of two primes.