The number 59498
59498 is a composite number with 8 divisors. Its prime factorisation is 2 × 71 × 419. Divisors (8): 1, 2, 71, 142, 419, 838, 29749, 59498.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59498 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59498 is composite. Its prime factorisation is
- 3
The divisors add up to 90720; without 59498 itself that is 31222, so 59498 is deficient (31222 is less than 59498). Euler's totient φ(59498) = 29260 numbers up to 59498 share no factor with it.
- 4
The digits of 59498 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59498 = 2 \times 71 \times 419 \]
59498 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90720 |
| Euler totient φ(n) | 29260 |
| Square | 3540012004 |
| Cube | 210623634213992 |
| Square root | 243.922119 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.9498 × |
59498 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and ninety-eight |
| Binary (base 2) | 1110100001101010 |
| Octal (base 8) | 164152 |
| Hexadecimal (base 16) | E86A |
| Base 3 | 10000121122 |
| As time | 59498 seconds = 16 h 31 min 38 s |
Is 59498 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59498 ÷ 2 = 29749) | 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 | No (remainder 3) | 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 5) | 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 2) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 59498 a prime number?
No. 59498 = 2 × 71 × 419, so it is divisible by 2.
What are the factors of 59498?
1, 2, 71, 142, 419, 838, 29749, 59498.
What is 59498 in binary?
1110100001101010 (hexadecimal E86A, octal 164152).
What is the square root of 59498?
About 243.9221.
Is 59498 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 59498?
It is a composite number with 8 divisors.