The number 85748
85748 is a composite number with 24 divisors. Its prime factorisation is × 13 × 17 × 97. Divisors (24): 1, 2, 4, 13, 17, 26, 34, 52, 68, 97, 194, 221, 388, 442, 884, 1261 … 85748.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85748 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85748 is composite. Its prime factorisation is
- 3
The divisors add up to 172872; without 85748 itself that is 87124, so 85748 is abundant (87124 is more than 85748). Euler's totient φ(85748) = 36864 numbers up to 85748 share no factor with it.
- 4
The digits of 85748 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 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85748 = 2^{2} \times 13 \times 17 \times 97 \]85748 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 172872 |
| Euler totient φ(n) | 36864 |
| Square | 7352719504 |
| Cube | 630480992028992 |
| Square root | 292.827594 (= 2√21437) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 195 |
| Scientific notation | 8.5748 × |
85748 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand seven hundred and forty-eight |
| Binary (base 2) | 10100111011110100 |
| Octal (base 8) | 247364 |
| Hexadecimal (base 16) | 14EF4 |
| Base 3 | 11100121212 |
| As time | 85748 seconds = 23 h 49 min 8 s |
Is 85748 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (85748 ÷ 2 = 42874) | 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 (85748 ÷ 4 = 21437) | 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 | 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 4) | 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 3) | 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 85748 a prime number?
No. 85748 = × 13 × 17 × 97, so it is divisible by 2.
What are the factors of 85748?
1, 2, 4, 13, 17, 26, 34, 52, 68, 97, 194, 221, 388, 442, 884, 1261, 1649, 2522, 3298, 5044, 6596, 21437, 42874, 85748.
What is 85748 in binary?
10100111011110100 (hexadecimal 14EF4, octal 247364).
What is the square root of 85748?
About 292.8276, exactly 2√21437.
Is 85748 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 85748?
It is a composite number with 24 divisors.