The number 85701
85701 is a composite number with 24 divisors. Its prime factorisation is 3 × × 11 × 53. Divisors (24): 1, 3, 7, 11, 21, 33, 49, 53, 77, 147, 159, 231, 371, 539, 583, 1113 … 85701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85701: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
85701 is composite. Its prime factorisation is
- 3
The divisors add up to 147744; without 85701 itself that is 62043, so 85701 is deficient (62043 is less than 85701). Euler's totient φ(85701) = 43680 numbers up to 85701 share no factor with it.
- 4
The digits of 85701 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85701 = 3 \times 7^{2} \times 11 \times 53 \]85701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 147744 |
| Euler totient φ(n) | 43680 |
| Square | 7344661401 |
| Cube | 629444826727101 |
| Square root | 292.747331 (= 7√1749) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 32 |
| Scientific notation | 8.5701 × |
85701 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand seven hundred and one |
| Binary (base 2) | 10100111011000101 |
| Octal (base 8) | 247305 |
| Hexadecimal (base 16) | 14EC5 |
| Base 3 | 11100120010 |
| As time | 85701 seconds = 23 h 48 min 21 s |
Is 85701 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 (85701 ÷ 3 = 28567) | 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 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 | Yes (85701 ÷ 7 = 12243) | 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 5) | 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 | Yes (85701 ÷ 11 = 7791) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85701 a prime number?
No. 85701 = 3 × × 11 × 53, so it is divisible by 3.
What are the factors of 85701?
1, 3, 7, 11, 21, 33, 49, 53, 77, 147, 159, 231, 371, 539, 583, 1113, 1617, 1749, 2597, 4081, 7791, 12243, 28567, 85701.
What is 85701 in binary?
10100111011000101 (hexadecimal 14EC5, octal 247305).
What is the square root of 85701?
About 292.7473, exactly 7√1749.
Is 85701 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 85701?
85701 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.