The number 59390
59390 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5939. Divisors (8): 1, 2, 5, 10, 5939, 11878, 29695, 59390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59390 is composite. Its prime factorisation is
- 3
The divisors add up to 106920; without 59390 itself that is 47530, so 59390 is deficient (47530 is less than 59390). Euler's totient φ(59390) = 23752 numbers up to 59390 share no factor with it.
- 4
The digits of 59390 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 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59390 = 2 \times 5 \times 5939 \]
59390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 106920 |
| Euler totient φ(n) | 23752 |
| Square | 3527172100 |
| Cube | 209478751019000 |
| Square root | 243.700636 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 148 |
| Scientific notation | 5.939 × |
59390 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand three hundred and ninety |
| Binary (base 2) | 1110011111111110 |
| Octal (base 8) | 163776 |
| Hexadecimal (base 16) | E7FE |
| Base 3 | 10000110122 |
| As time | 59390 seconds = 16 h 29 min 50 s |
Is 59390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59390 ÷ 2 = 29695) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59390 ÷ 5 = 11878) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | 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 | Yes (59390 ÷ 10 = 5939) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59390 a prime number?
No. 59390 = 2 × 5 × 5939, so it is divisible by 2.
What are the factors of 59390?
1, 2, 5, 10, 5939, 11878, 29695, 59390.
What is 59390 in binary?
1110011111111110 (hexadecimal E7FE, octal 163776).
What is the square root of 59390?
About 243.7006.
Is 59390 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 59390?
It is a composite number with 8 divisors.