The number 59061
59061 is a composite number with 4 divisors. Its prime factorisation is 3 × 19687. Divisors (4): 1, 3, 19687, 59061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59061: a semiprime: 3 × 19687, the product of two primes.
- 2
59061 is composite. Its prime factorisation is
- 3
The divisors add up to 78752; without 59061 itself that is 19691, so 59061 is deficient (19691 is less than 59061). Euler's totient φ(59061) = 39372 numbers up to 59061 share no factor with it.
- 4
The digits of 59061 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 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59061 = 3 \times 19687 \]
59061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 78752 |
| Euler totient φ(n) | 39372 |
| Square | 3488201721 |
| Cube | 206016681843981 |
| Square root | 243.024690 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9061 × |
59061 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and sixty-one |
| Binary (base 2) | 1110011010110101 |
| Octal (base 8) | 163265 |
| Hexadecimal (base 16) | E6B5 |
| Base 3 | 10000000110 |
| As time | 59061 seconds = 16 h 24 min 21 s |
Is 59061 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 (59061 ÷ 3 = 19687) | 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 5) | 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 2) | 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 59061 a prime number?
No. 59061 = 3 × 19687, so it is divisible by 3.
What are the factors of 59061?
1, 3, 19687, 59061.
What is 59061 in binary?
1110011010110101 (hexadecimal E6B5, octal 163265).
What is the square root of 59061?
About 243.0247.
Is 59061 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 59061?
59061 is a semiprime: 3 × 19687, the product of two primes.