The number 67565
67565 is a composite number with 4 divisors. Its prime factorisation is 5 × 13513. Divisors (4): 1, 5, 13513, 67565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 67565: a semiprime: 5 × 13513, the product of two primes.
- 2
67565 is composite. Its prime factorisation is
- 3
The divisors add up to 81084; without 67565 itself that is 13519, so 67565 is deficient (13519 is less than 67565). Euler's totient φ(67565) = 54048 numbers up to 67565 share no factor with it.
- 4
The digits of 67565 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 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 67565 = 5 \times 13513 \]
67565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 81084 |
| Euler totient φ(n) | 54048 |
| Square | 4565029225 |
| Cube | 308436199587125 |
| Square root | 259.932684 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 161 |
| Scientific notation | 6.7565 × |
67565 in other forms
| Form | Value |
|---|---|
| In words | sixty-seven thousand five hundred and sixty-five |
| Binary (base 2) | 10000011111101101 |
| Octal (base 8) | 203755 |
| Hexadecimal (base 16) | 107ED |
| Base 3 | 10102200102 |
| As time | 67565 seconds = 18 h 46 min 5 s |
Is 67565 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 (67565 ÷ 5 = 13513) | 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 5) | 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 3) | 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 67565 a prime number?
No. 67565 = 5 × 13513, so it is divisible by 5.
What are the factors of 67565?
1, 5, 13513, 67565.
What is 67565 in binary?
10000011111101101 (hexadecimal 107ED, octal 203755).
What is the square root of 67565?
About 259.9327.
Is 67565 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 67565?
67565 is a semiprime: 5 × 13513, the product of two primes.