The number 85330
85330 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 7 × 23 × 53. Divisors (32): 1, 2, 5, 7, 10, 14, 23, 35, 46, 53, 70, 106, 115, 161, 230, 265 … 85330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85330 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85330 is composite. Its prime factorisation is
- 3
The divisors add up to 186624; without 85330 itself that is 101294, so 85330 is abundant (101294 is more than 85330). Euler's totient φ(85330) = 27456 numbers up to 85330 share no factor with it.
- 4
The digits of 85330 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85330 = 2 \times 5 \times 7 \times 23 \times 53 \]
85330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 186624 |
| Euler totient φ(n) | 27456 |
| Square | 7281208900 |
| Cube | 621305555437000 |
| Square root | 292.112992 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 102 |
| Scientific notation | 8.533 × |
85330 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand three hundred and thirty |
| Binary (base 2) | 10100110101010010 |
| Octal (base 8) | 246522 |
| Hexadecimal (base 16) | 14D52 |
| Base 3 | 11100001101 |
| As time | 85330 seconds = 23 h 42 min 10 s |
Is 85330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (85330 ÷ 2 = 42665) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (85330 ÷ 5 = 17066) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (85330 ÷ 7 = 12190) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (85330 ÷ 10 = 8533) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85330 a prime number?
No. 85330 = 2 × 5 × 7 × 23 × 53, so it is divisible by 2.
What are the factors of 85330?
1, 2, 5, 7, 10, 14, 23, 35, 46, 53, 70, 106, 115, 161, 230, 265, 322, 371, 530, 742, 805, 1219, 1610, 1855, 2438, 3710, 6095, 8533, 12190, 17066, 42665, 85330.
What is 85330 in binary?
10100110101010010 (hexadecimal 14D52, octal 246522).
What is the square root of 85330?
About 292.1130.
Is 85330 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 85330?
It is a composite number with 32 divisors.