The number 85489
85489 is a composite number with 4 divisors. Its prime factorisation is 53 × 1613. Divisors (4): 1, 53, 1613, 85489.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85489: a semiprime: 53 × 1613, the product of two primes.
- 2
85489 is composite. Its prime factorisation is
- 3
The divisors add up to 87156; without 85489 itself that is 1667, so 85489 is deficient (1667 is less than 85489). Euler's totient φ(85489) = 83824 numbers up to 85489 share no factor with it.
- 4
The digits of 85489 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85489 = 53 \times 1613 \]
85489 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87156 |
| Euler totient φ(n) | 83824 |
| Square | 7308369121 |
| Cube | 624785167785169 |
| Square root | 292.385020 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 50 |
| Scientific notation | 8.5489 × |
85489 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand four hundred and eighty-nine |
| Binary (base 2) | 10100110111110001 |
| Octal (base 8) | 246761 |
| Hexadecimal (base 16) | 14DF1 |
| Base 3 | 11100021021 |
| As time | 85489 seconds = 23 h 44 min 49 s |
Is 85489 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 | No (remainder 4) | 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 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 1) | 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 9) | 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 85489 a prime number?
No. 85489 = 53 × 1613, so it is divisible by 53.
What are the factors of 85489?
1, 53, 1613, 85489.
What is 85489 in binary?
10100110111110001 (hexadecimal 14DF1, octal 246761).
What is the square root of 85489?
About 292.3850.
Is 85489 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 85489?
85489 is a semiprime: 53 × 1613, the product of two primes.