The number 51065
51065 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 1459. Divisors (8): 1, 5, 7, 35, 1459, 7295, 10213, 51065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51065 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51065 is composite. Its prime factorisation is
- 3
The divisors add up to 70080; without 51065 itself that is 19015, so 51065 is deficient (19015 is less than 51065). Euler's totient φ(51065) = 34992 numbers up to 51065 share no factor with it.
- 4
The digits of 51065 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51065 = 5 \times 7 \times 1459 \]
51065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70080 |
| Euler totient φ(n) | 34992 |
| Square | 2607634225 |
| Cube | 133158841699625 |
| Square root | 225.975662 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.1065 × |
51065 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and sixty-five |
| Binary (base 2) | 1100011101111001 |
| Octal (base 8) | 143571 |
| Hexadecimal (base 16) | C779 |
| Base 3 | 2121001022 |
| As time | 51065 seconds = 14 h 11 min 5 s |
Is 51065 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 2) | 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 (51065 ÷ 5 = 10213) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (51065 ÷ 7 = 7295) | 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 8) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51065 a prime number?
No. 51065 = 5 × 7 × 1459, so it is divisible by 5.
What are the factors of 51065?
1, 5, 7, 35, 1459, 7295, 10213, 51065.
What is 51065 in binary?
1100011101111001 (hexadecimal C779, octal 143571).
What is the square root of 51065?
About 225.9757.
Is 51065 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51065?
It is a composite number with 8 divisors.