The number 85971
85971 is a composite number with 4 divisors. Its prime factorisation is 3 × 28657. Divisors (4): 1, 3, 28657, 85971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85971: a semiprime: 3 × 28657, the product of two primes.
- 2
85971 is composite. Its prime factorisation is
- 3
The divisors add up to 114632; without 85971 itself that is 28661, so 85971 is deficient (28661 is less than 85971). Euler's totient φ(85971) = 57312 numbers up to 85971 share no factor with it.
- 4
The digits of 85971 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85971 = 3 \times 28657 \]
85971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 114632 |
| Euler totient φ(n) | 57312 |
| Square | 7391012841 |
| Cube | 635412764953611 |
| Square root | 293.208117 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 8.5971 × |
85971 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand nine hundred and seventy-one |
| Binary (base 2) | 10100111111010011 |
| Octal (base 8) | 247723 |
| Hexadecimal (base 16) | 14FD3 |
| Base 3 | 11100221010 |
| As time | 85971 seconds = 23 h 52 min 51 s |
Is 85971 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 | Yes (85971 ÷ 3 = 28657) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85971 a prime number?
No. 85971 = 3 × 28657, so it is divisible by 3.
What are the factors of 85971?
1, 3, 28657, 85971.
What is 85971 in binary?
10100111111010011 (hexadecimal 14FD3, octal 247723).
What is the square root of 85971?
About 293.2081.
Is 85971 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 85971?
85971 is a semiprime: 3 × 28657, the product of two primes.