The number 59485
59485 is a composite number with 4 divisors. Its prime factorisation is 5 × 11897. Divisors (4): 1, 5, 11897, 59485.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59485: a semiprime: 5 × 11897, the product of two primes.
- 2
59485 is composite. Its prime factorisation is
- 3
The divisors add up to 71388; without 59485 itself that is 11903, so 59485 is deficient (11903 is less than 59485). Euler's totient φ(59485) = 47584 numbers up to 59485 share no factor with it.
- 4
The digits of 59485 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59485 = 5 \times 11897 \]
59485 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71388 |
| Euler totient φ(n) | 47584 |
| Square | 3538465225 |
| Cube | 210485603909125 |
| Square root | 243.895469 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.9485 × |
59485 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and eighty-five |
| Binary (base 2) | 1110100001011101 |
| Octal (base 8) | 164135 |
| Hexadecimal (base 16) | E85D |
| Base 3 | 10000121011 |
| As time | 59485 seconds = 16 h 31 min 25 s |
Is 59485 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 1) | 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 (59485 ÷ 5 = 11897) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59485 a prime number?
No. 59485 = 5 × 11897, so it is divisible by 5.
What are the factors of 59485?
1, 5, 11897, 59485.
What is 59485 in binary?
1110100001011101 (hexadecimal E85D, octal 164135).
What is the square root of 59485?
About 243.8955.
Is 59485 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 59485?
59485 is a semiprime: 5 × 11897, the product of two primes.