The number 65507
65507 is a composite number with 4 divisors. Its prime factorisation is 13 × 5039. Divisors (4): 1, 13, 5039, 65507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65507: a semiprime: 13 × 5039, the product of two primes.
- 2
65507 is composite. Its prime factorisation is
- 3
The divisors add up to 70560; without 65507 itself that is 5053, so 65507 is deficient (5053 is less than 65507). Euler's totient φ(65507) = 60456 numbers up to 65507 share no factor with it.
- 4
The digits of 65507 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 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65507 = 13 \times 5039 \]
65507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70560 |
| Euler totient φ(n) | 60456 |
| Square | 4291167049 |
| Cube | 281101479878843 |
| Square root | 255.943353 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 68 |
| Scientific notation | 6.5507 × |
65507 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand five hundred and seven |
| Binary (base 2) | 1111111111100011 |
| Octal (base 8) | 177743 |
| Hexadecimal (base 16) | FFE3 |
| Base 3 | 10022212012 |
| As time | 65507 seconds = 18 h 11 min 47 s |
Is 65507 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 | No (remainder 2) | 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 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 65507 a prime number?
No. 65507 = 13 × 5039, so it is divisible by 13.
What are the factors of 65507?
1, 13, 5039, 65507.
What is 65507 in binary?
1111111111100011 (hexadecimal FFE3, octal 177743).
What is the square root of 65507?
About 255.9434.
Is 65507 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 65507?
65507 is a semiprime: 13 × 5039, the product of two primes.