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