The number 65005
65005 is a composite number with 4 divisors. Its prime factorisation is 5 × 13001. Divisors (4): 1, 5, 13001, 65005.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65005: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 13001, the product of two primes.
- 2
65005 is composite. Its prime factorisation is
- 3
The divisors add up to 78012; without 65005 itself that is 13007, so 65005 is deficient (13007 is less than 65005). Euler's totient φ(65005) = 52000 numbers up to 65005 share no factor with it.
- 4
The digits of 65005 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65005 = 5 \times 13001 \]
65005 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 78012 |
| Euler totient φ(n) | 52000 |
| Square | 4225650025 |
| Cube | 274688379875125 |
| Square root | 254.960781 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 99 |
| Scientific notation | 6.5005 × |
65005 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand and five |
| Binary (base 2) | 1111110111101101 |
| Octal (base 8) | 176755 |
| Hexadecimal (base 16) | FDED |
| Base 3 | 10022011121 |
| As time | 65005 seconds = 18 h 3 min 25 s |
Is 65005 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 (65005 ÷ 5 = 13001) | 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 3) | 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 7) | 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 6) | 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 65005 a prime number?
No. 65005 = 5 × 13001, so it is divisible by 5.
What are the factors of 65005?
1, 5, 13001, 65005.
What is 65005 in binary?
1111110111101101 (hexadecimal FDED, octal 176755).
What is the square root of 65005?
About 254.9608.
Is 65005 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 65005?
65005 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 13001, the product of two primes.