The number 59398
59398 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 1747. Divisors (8): 1, 2, 17, 34, 1747, 3494, 29699, 59398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59398: a Harshad number: divisible by its digit sum 34.
- 2
59398 is composite. Its prime factorisation is
- 3
The divisors add up to 94392; without 59398 itself that is 34994, so 59398 is deficient (34994 is less than 59398). Euler's totient φ(59398) = 27936 numbers up to 59398 share no factor with it.
- 4
The digits of 59398 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59398 = 2 \times 17 \times 1747 \]
59398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 94392 |
| Euler totient φ(n) | 27936 |
| Square | 3528122404 |
| Cube | 209563414552792 |
| Square root | 243.717049 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.9398 × |
59398 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand three hundred and ninety-eight |
| Binary (base 2) | 1110100000000110 |
| Octal (base 8) | 164006 |
| Hexadecimal (base 16) | E806 |
| Base 3 | 10000110221 |
| As time | 59398 seconds = 16 h 29 min 58 s |
Is 59398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59398 ÷ 2 = 29699) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59398 a prime number?
No. 59398 = 2 × 17 × 1747, so it is divisible by 2.
What are the factors of 59398?
1, 2, 17, 34, 1747, 3494, 29699, 59398.
What is 59398 in binary?
1110100000000110 (hexadecimal E806, octal 164006).
What is the square root of 59398?
About 243.7170.
Is 59398 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 59398?
59398 is a Harshad number: divisible by its digit sum 34.