The number 85568
85568 is a composite number with 28 divisors. Its prime factorisation is × 7 × 191. Divisors (28): 1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 112, 191, 224, 382, 448 … 85568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85568: a Harshad number: divisible by its digit sum 32.
- 2
85568 is composite. Its prime factorisation is
- 3
The divisors add up to 195072; without 85568 itself that is 109504, so 85568 is abundant (109504 is more than 85568). Euler's totient φ(85568) = 36480 numbers up to 85568 share no factor with it.
- 4
The digits of 85568 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85568 = 2^{6} \times 7 \times 191 \]85568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 195072 |
| Euler totient φ(n) | 36480 |
| Square | 7321882624 |
| Cube | 626518852370432 |
| Square root | 292.520085 (= 8√1337) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 50 |
| Scientific notation | 8.5568 × |
85568 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand five hundred and sixty-eight |
| Binary (base 2) | 10100111001000000 |
| Octal (base 8) | 247100 |
| Hexadecimal (base 16) | 14E40 |
| Base 3 | 11100101012 |
| As time | 85568 seconds = 23 h 46 min 8 s |
Is 85568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (85568 ÷ 2 = 42784) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (85568 ÷ 4 = 21392) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (85568 ÷ 7 = 12224) | 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 | Yes (85568 ÷ 8 = 10696) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85568 a prime number?
No. 85568 = × 7 × 191, so it is divisible by 2.
What are the factors of 85568?
1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 112, 191, 224, 382, 448, 764, 1337, 1528, 2674, 3056, 5348, 6112, 10696, 12224, 21392, 42784, 85568.
What is 85568 in binary?
10100111001000000 (hexadecimal 14E40, octal 247100).
What is the square root of 85568?
About 292.5201, exactly 8√1337.
Is 85568 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 85568?
85568 is a Harshad number: divisible by its digit sum 32.