The number 59361
59361 is a composite number with 8 divisors. Its prime factorisation is 3 × 47 × 421. Divisors (8): 1, 3, 47, 141, 421, 1263, 19787, 59361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59361 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59361 is composite. Its prime factorisation is
- 3
The divisors add up to 81024; without 59361 itself that is 21663, so 59361 is deficient (21663 is less than 59361). Euler's totient φ(59361) = 38640 numbers up to 59361 share no factor with it.
- 4
The digits of 59361 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59361 = 3 \times 47 \times 421 \]
59361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81024 |
| Euler totient φ(n) | 38640 |
| Square | 3523728321 |
| Cube | 209172036862881 |
| Square root | 243.641130 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9361 × |
59361 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand three hundred and sixty-one |
| Binary (base 2) | 1110011111100001 |
| Octal (base 8) | 163741 |
| Hexadecimal (base 16) | E7E1 |
| Base 3 | 10000102120 |
| As time | 59361 seconds = 16 h 29 min 21 s |
Is 59361 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 (59361 ÷ 3 = 19787) | 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 1) | 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 5) | 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 59361 a prime number?
No. 59361 = 3 × 47 × 421, so it is divisible by 3.
What are the factors of 59361?
1, 3, 47, 141, 421, 1263, 19787, 59361.
What is 59361 in binary?
1110011111100001 (hexadecimal E7E1, octal 163741).
What is the square root of 59361?
About 243.6411.
Is 59361 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 59361?
It is a composite number with 8 divisors.