The number 85963
85963 is a composite number with 8 divisors. Its prime factorisation is 31 × 47 × 59. Divisors (8): 1, 31, 47, 59, 1457, 1829, 2773, 85963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85963: a Harshad number: divisible by its digit sum 31.
- 2
85963 is composite. Its prime factorisation is
- 3
The divisors add up to 92160; without 85963 itself that is 6197, so 85963 is deficient (6197 is less than 85963). Euler's totient φ(85963) = 80040 numbers up to 85963 share no factor with it.
- 4
The digits of 85963 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85963 = 31 \times 47 \times 59 \]
85963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 92160 |
| Euler totient φ(n) | 80040 |
| Square | 7389637369 |
| Cube | 635235397151347 |
| Square root | 293.194475 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.5963 × |
85963 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand nine hundred and sixty-three |
| Binary (base 2) | 10100111111001011 |
| Octal (base 8) | 247713 |
| Hexadecimal (base 16) | 14FCB |
| Base 3 | 11100220211 |
| As time | 85963 seconds = 23 h 52 min 43 s |
Is 85963 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 3) | 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 1) | 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 3) | 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 3) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85963 a prime number?
No. 85963 = 31 × 47 × 59, so it is divisible by 31.
What are the factors of 85963?
1, 31, 47, 59, 1457, 1829, 2773, 85963.
What is 85963 in binary?
10100111111001011 (hexadecimal 14FCB, octal 247713).
What is the square root of 85963?
About 293.1945.
Is 85963 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 85963?
85963 is a Harshad number: divisible by its digit sum 31.