The number 39065
39065 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 601. Divisors (8): 1, 5, 13, 65, 601, 3005, 7813, 39065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39065 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39065 is composite. Its prime factorisation is
- 3
The divisors add up to 50568; without 39065 itself that is 11503, so 39065 is deficient (11503 is less than 39065). Euler's totient φ(39065) = 28800 numbers up to 39065 share no factor with it.
- 4
The digits of 39065 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39065 = 5 \times 13 \times 601 \]
39065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 50568 |
| Euler totient φ(n) | 28800 |
| Square | 1526074225 |
| Cube | 59616089599625 |
| Square root | 197.648678 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 106 |
| Scientific notation | 3.9065 × |
39065 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and sixty-five |
| Binary (base 2) | 1001100010011001 |
| Octal (base 8) | 114231 |
| Hexadecimal (base 16) | 9899 |
| Base 3 | 1222120212 |
| As time | 39065 seconds = 10 h 51 min 5 s |
Is 39065 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 (39065 ÷ 5 = 7813) | 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 | 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 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 39065 a prime number?
No. 39065 = 5 × 13 × 601, so it is divisible by 5.
What are the factors of 39065?
1, 5, 13, 65, 601, 3005, 7813, 39065.
What is 39065 in binary?
1001100010011001 (hexadecimal 9899, octal 114231).
What is the square root of 39065?
About 197.6487.
Is 39065 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 39065?
It is a composite number with 8 divisors.