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