The number 59345
59345 is a composite number with 16 divisors. Its prime factorisation is 5 × 11 × 13 × 83. Divisors (16): 1, 5, 11, 13, 55, 65, 83, 143, 415, 715, 913, 1079, 4565, 5395, 11869, 59345.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59345 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59345 is composite. Its prime factorisation is
- 3
The divisors add up to 84672; without 59345 itself that is 25327, so 59345 is deficient (25327 is less than 59345). Euler's totient φ(59345) = 39360 numbers up to 59345 share no factor with it.
- 4
The digits of 59345 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59345 = 5 \times 11 \times 13 \times 83 \]
59345 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 84672 |
| Euler totient φ(n) | 39360 |
| Square | 3521829025 |
| Cube | 209002943488625 |
| Square root | 243.608292 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.9345 × |
59345 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand three hundred and forty-five |
| Binary (base 2) | 1110011111010001 |
| Octal (base 8) | 163721 |
| Hexadecimal (base 16) | E7D1 |
| Base 3 | 10000101222 |
| As time | 59345 seconds = 16 h 29 min 5 s |
Is 59345 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 2) | 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 | Yes (59345 ÷ 5 = 11869) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (59345 ÷ 11 = 5395) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59345 a prime number?
No. 59345 = 5 × 11 × 13 × 83, so it is divisible by 5.
What are the factors of 59345?
1, 5, 11, 13, 55, 65, 83, 143, 415, 715, 913, 1079, 4565, 5395, 11869, 59345.
What is 59345 in binary?
1110011111010001 (hexadecimal E7D1, octal 163721).
What is the square root of 59345?
About 243.6083.
Is 59345 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 59345?
It is a composite number with 16 divisors.