The number 85671
85671 is a composite number with 16 divisors. Its prime factorisation is × 19 × 167. Divisors (16): 1, 3, 9, 19, 27, 57, 167, 171, 501, 513, 1503, 3173, 4509, 9519, 28557, 85671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85671: a Harshad number: divisible by its digit sum 27.
- 2
85671 is composite. Its prime factorisation is
- 3
The divisors add up to 134400; without 85671 itself that is 48729, so 85671 is deficient (48729 is less than 85671). Euler's totient φ(85671) = 53784 numbers up to 85671 share no factor with it.
- 4
The digits of 85671 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 239 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85671 = 3^{3} \times 19 \times 167 \]85671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 134400 |
| Euler totient φ(n) | 53784 |
| Square | 7339520241 |
| Cube | 628784038566711 |
| Square root | 292.696088 (= 3√9519) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 239 |
| Scientific notation | 8.5671 × |
85671 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand six hundred and seventy-one |
| Binary (base 2) | 10100111010100111 |
| Octal (base 8) | 247247 |
| Hexadecimal (base 16) | 14EA7 |
| Base 3 | 11100112000 |
| As time | 85671 seconds = 23 h 47 min 51 s |
Is 85671 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 (85671 ÷ 3 = 28557) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (85671 ÷ 9 = 9519) | 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 3) | 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 85671 a prime number?
No. 85671 = × 19 × 167, so it is divisible by 3.
What are the factors of 85671?
1, 3, 9, 19, 27, 57, 167, 171, 501, 513, 1503, 3173, 4509, 9519, 28557, 85671.
What is 85671 in binary?
10100111010100111 (hexadecimal 14EA7, octal 247247).
What is the square root of 85671?
About 292.6961, exactly 3√9519.
Is 85671 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 85671?
85671 is a Harshad number: divisible by its digit sum 27.