The number 51085
51085 is a composite number with 8 divisors. Its prime factorisation is 5 × 17 × 601. Divisors (8): 1, 5, 17, 85, 601, 3005, 10217, 51085.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51085 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51085 is composite. Its prime factorisation is
- 3
The divisors add up to 65016; without 51085 itself that is 13931, so 51085 is deficient (13931 is less than 51085). Euler's totient φ(51085) = 38400 numbers up to 51085 share no factor with it.
- 4
The digits of 51085 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51085 = 5 \times 17 \times 601 \]
51085 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65016 |
| Euler totient φ(n) | 38400 |
| Square | 2609677225 |
| Cube | 133315361039125 |
| Square root | 226.019911 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1085 × |
51085 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and eighty-five |
| Binary (base 2) | 1100011110001101 |
| Octal (base 8) | 143615 |
| Hexadecimal (base 16) | C78D |
| Base 3 | 2121002001 |
| As time | 51085 seconds = 14 h 11 min 25 s |
Is 51085 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 | No (remainder 1) | 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 | Yes (51085 ÷ 5 = 10217) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51085 a prime number?
No. 51085 = 5 × 17 × 601, so it is divisible by 5.
What are the factors of 51085?
1, 5, 17, 85, 601, 3005, 10217, 51085.
What is 51085 in binary?
1100011110001101 (hexadecimal C78D, octal 143615).
What is the square root of 51085?
About 226.0199.
Is 51085 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51085?
It is a composite number with 8 divisors.