The number 59461
59461 is a composite number with 4 divisors. Its prime factorisation is 97 × 613. Divisors (4): 1, 97, 613, 59461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59461: a semiprime: 97 × 613, the product of two primes.
- 2
59461 is composite. Its prime factorisation is
- 3
The divisors add up to 60172; without 59461 itself that is 711, so 59461 is deficient (711 is less than 59461). Euler's totient φ(59461) = 58752 numbers up to 59461 share no factor with it.
- 4
The digits of 59461 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59461 = 97 \times 613 \]
59461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60172 |
| Euler totient φ(n) | 58752 |
| Square | 3535610521 |
| Cube | 210230937189181 |
| Square root | 243.846263 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 42 |
| Scientific notation | 5.9461 × |
59461 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and sixty-one |
| Binary (base 2) | 1110100001000101 |
| Octal (base 8) | 164105 |
| Hexadecimal (base 16) | E845 |
| Base 3 | 10000120021 |
| As time | 59461 seconds = 16 h 31 min 1 s |
Is 59461 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 | No (remainder 1) | 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59461 a prime number?
No. 59461 = 97 × 613, so it is divisible by 97.
What are the factors of 59461?
1, 97, 613, 59461.
What is 59461 in binary?
1110100001000101 (hexadecimal E845, octal 164105).
What is the square root of 59461?
About 243.8463.
Is 59461 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 59461?
59461 is a semiprime: 97 × 613, the product of two primes.