The number 69561
69561 is a composite number with 12 divisors. Its prime factorisation is × 59 × 131. Divisors (12): 1, 3, 9, 59, 131, 177, 393, 531, 1179, 7729, 23187, 69561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69561 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69561 is composite. Its prime factorisation is
- 3
The divisors add up to 102960; without 69561 itself that is 33399, so 69561 is deficient (33399 is less than 69561). Euler's totient φ(69561) = 45240 numbers up to 69561 share no factor with it.
- 4
The digits of 69561 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 187 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69561 = 3^{2} \times 59 \times 131 \]69561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 102960 |
| Euler totient φ(n) | 45240 |
| Square | 4838732721 |
| Cube | 336587086805481 |
| Square root | 263.744194 (= 3√7729) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 187 |
| Scientific notation | 6.9561 × |
69561 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand five hundred and sixty-one |
| Binary (base 2) | 10000111110111001 |
| Octal (base 8) | 207671 |
| Hexadecimal (base 16) | 10FB9 |
| Base 3 | 10112102100 |
| As time | 69561 seconds = 19 h 19 min 21 s |
Is 69561 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 | Yes (69561 ÷ 3 = 23187) | 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 3) | 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 | Yes (69561 ÷ 9 = 7729) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69561 a prime number?
No. 69561 = × 59 × 131, so it is divisible by 3.
What are the factors of 69561?
1, 3, 9, 59, 131, 177, 393, 531, 1179, 7729, 23187, 69561.
What is 69561 in binary?
10000111110111001 (hexadecimal 10FB9, octal 207671).
What is the square root of 69561?
About 263.7442, exactly 3√7729.
Is 69561 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 69561?
It is a composite number with 12 divisors.