The number 69601
69601 is a binary palindrome (10000111111100001). Its prime factorisation is 7 × 61 × 163. Divisors (8): 1, 7, 61, 163, 427, 1141, 9943, 69601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69601: a binary palindrome (10000111111100001).
- 2
69601 is composite. Its prime factorisation is
- 3
The divisors add up to 81344; without 69601 itself that is 11743, so 69601 is deficient (11743 is less than 69601). Euler's totient φ(69601) = 58320 numbers up to 69601 share no factor with it.
- 4
The digits of 69601 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69601 = 7 \times 61 \times 163 \]
69601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81344 |
| Euler totient φ(n) | 58320 |
| Square | 4844299201 |
| Cube | 337168068688801 |
| Square root | 263.820014 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9601 × |
69601 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand six hundred and one |
| Binary (base 2) | 10000111111100001 |
| Octal (base 8) | 207741 |
| Hexadecimal (base 16) | 10FE1 |
| Base 3 | 10112110211 |
| As time | 69601 seconds = 19 h 20 min 1 s |
Is 69601 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 | No (remainder 1) | 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 | Yes (69601 ÷ 7 = 9943) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 69601 a prime number?
No. 69601 = 7 × 61 × 163, so it is divisible by 7.
What are the factors of 69601?
1, 7, 61, 163, 427, 1141, 9943, 69601.
What is 69601 in binary?
10000111111100001 (hexadecimal 10FE1, octal 207741).
What is the square root of 69601?
About 263.8200.
Is 69601 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 69601?
69601 is a binary palindrome (10000111111100001).