The number 65495
65495 is a composite number with 4 divisors. Its prime factorisation is 5 × 13099. Divisors (4): 1, 5, 13099, 65495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65495: a semiprime: 5 × 13099, the product of two primes.
- 2
65495 is composite. Its prime factorisation is
- 3
The divisors add up to 78600; without 65495 itself that is 13105, so 65495 is deficient (13105 is less than 65495). Euler's totient φ(65495) = 52392 numbers up to 65495 share no factor with it.
- 4
The digits of 65495 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65495 = 5 \times 13099 \]
65495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 78600 |
| Euler totient φ(n) | 52392 |
| Square | 4289595025 |
| Cube | 280947026162375 |
| Square root | 255.919909 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 73 |
| Scientific notation | 6.5495 × |
65495 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand four hundred and ninety-five |
| Binary (base 2) | 1111111111010111 |
| Octal (base 8) | 177727 |
| Hexadecimal (base 16) | FFD7 |
| Base 3 | 10022211202 |
| As time | 65495 seconds = 18 h 11 min 35 s |
Is 65495 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (65495 ÷ 5 = 13099) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65495 a prime number?
No. 65495 = 5 × 13099, so it is divisible by 5.
What are the factors of 65495?
1, 5, 13099, 65495.
What is 65495 in binary?
1111111111010111 (hexadecimal FFD7, octal 177727).
What is the square root of 65495?
About 255.9199.
Is 65495 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 65495?
65495 is a semiprime: 5 × 13099, the product of two primes.