The number 85913
85913 is a composite number with 4 divisors. Its prime factorisation is 53 × 1621. Divisors (4): 1, 53, 1621, 85913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85913: a semiprime: 53 × 1621, the product of two primes.
- 2
85913 is composite. Its prime factorisation is
- 3
The divisors add up to 87588; without 85913 itself that is 1675, so 85913 is deficient (1675 is less than 85913). Euler's totient φ(85913) = 84240 numbers up to 85913 share no factor with it.
- 4
The digits of 85913 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85913 = 53 \times 1621 \]
85913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87588 |
| Euler totient φ(n) | 84240 |
| Square | 7381043569 |
| Cube | 634127596143497 |
| Square root | 293.109195 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.5913 × |
85913 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand nine hundred and thirteen |
| Binary (base 2) | 10100111110011001 |
| Octal (base 8) | 247631 |
| Hexadecimal (base 16) | 14F99 |
| Base 3 | 11100211222 |
| As time | 85913 seconds = 23 h 51 min 53 s |
Is 85913 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 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85913 a prime number?
No. 85913 = 53 × 1621, so it is divisible by 53.
What are the factors of 85913?
1, 53, 1621, 85913.
What is 85913 in binary?
10100111110011001 (hexadecimal 14F99, octal 247631).
What is the square root of 85913?
About 293.1092.
Is 85913 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 85913?
85913 is a semiprime: 53 × 1621, the product of two primes.