The number 85569
85569 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 2593. Divisors (8): 1, 3, 11, 33, 2593, 7779, 28523, 85569.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85569: a Harshad number: divisible by its digit sum 33.
- 2
85569 is composite. Its prime factorisation is
- 3
The divisors add up to 124512; without 85569 itself that is 38943, so 85569 is deficient (38943 is less than 85569). Euler's totient φ(85569) = 51840 numbers up to 85569 share no factor with it.
- 4
The digits of 85569 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85569 = 3 \times 11 \times 2593 \]
85569 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 124512 |
| Euler totient φ(n) | 51840 |
| Square | 7322053761 |
| Cube | 626540818275009 |
| Square root | 292.521794 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 58 |
| Scientific notation | 8.5569 × |
85569 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand five hundred and sixty-nine |
| Binary (base 2) | 10100111001000001 |
| Octal (base 8) | 247101 |
| Hexadecimal (base 16) | 14E41 |
| Base 3 | 11100101020 |
| As time | 85569 seconds = 23 h 46 min 9 s |
Is 85569 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 (85569 ÷ 3 = 28523) | 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 4) | 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 1) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (85569 ÷ 11 = 7779) | 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 85569 a prime number?
No. 85569 = 3 × 11 × 2593, so it is divisible by 3.
What are the factors of 85569?
1, 3, 11, 33, 2593, 7779, 28523, 85569.
What is 85569 in binary?
10100111001000001 (hexadecimal 14E41, octal 247101).
What is the square root of 85569?
About 292.5218.
Is 85569 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 85569?
85569 is a Harshad number: divisible by its digit sum 33.