The number 1065
1065 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 71. Divisors (8): 1, 3, 5, 15, 71, 213, 355, 1065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1065 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1065 is composite. Its prime factorisation is
- 3
The divisors add up to 1728; without 1065 itself that is 663, so 1065 is deficient (663 is less than 1065). Euler's totient φ(1065) = 560 numbers up to 1065 share no factor with it.
- 4
The digits of 1065 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1065 = 3 \times 5 \times 71 \]
1065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1728 |
| Euler totient φ(n) | 560 |
| Square | 1134225 |
| Cube | 1207949625 |
| Square root | 32.634338 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 75 |
| Scientific notation | 1.065 × |
1065 in other forms
| Form | Value |
|---|---|
| In words | one thousand and sixty-five |
| Roman numerals | MLXV |
| Binary (base 2) | 10000101001 |
| Octal (base 8) | 2051 |
| Hexadecimal (base 16) | 429 |
| Base 3 | 1110110 |
| As time | 1065 seconds = 17 min 45 s |
Is 1065 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 | Yes (1065 ÷ 3 = 355) | 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 (1065 ÷ 5 = 213) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1065 a prime number?
No. 1065 = 3 × 5 × 71, so it is divisible by 3.
What are the factors of 1065?
1, 3, 5, 15, 71, 213, 355, 1065.
What is 1065 in binary?
10000101001 (hexadecimal 429, octal 2051).
What is the square root of 1065?
About 32.6343.
What is 1065 in Roman numerals?
MLXV.
Is 1065 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1065?
It is a composite number with 8 divisors.