The number 61569
61569 is a composite number with 6 divisors. Its prime factorisation is × 6841. Divisors (6): 1, 3, 9, 6841, 20523, 61569.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61569 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61569 is composite. Its prime factorisation is
- 3
The divisors add up to 88946; without 61569 itself that is 27377, so 61569 is deficient (27377 is less than 61569). Euler's totient φ(61569) = 41040 numbers up to 61569 share no factor with it.
- 4
The digits of 61569 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 210 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61569 = 3^{2} \times 6841 \]61569 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 88946 |
| Euler totient φ(n) | 41040 |
| Square | 3790741761 |
| Cube | 233392179483009 |
| Square root | 248.131014 (= 3√6841) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 210 |
| Scientific notation | 6.1569 × |
61569 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and sixty-nine |
| Binary (base 2) | 1111000010000001 |
| Octal (base 8) | 170201 |
| Hexadecimal (base 16) | F081 |
| Base 3 | 10010110100 |
| As time | 61569 seconds = 17 h 6 min 9 s |
Is 61569 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 (61569 ÷ 3 = 20523) | 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 4) | 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 4) | 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 (61569 ÷ 9 = 6841) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 61569 a prime number?
No. 61569 = × 6841, so it is divisible by 3.
What are the factors of 61569?
1, 3, 9, 6841, 20523, 61569.
What is 61569 in binary?
1111000010000001 (hexadecimal F081, octal 170201).
What is the square root of 61569?
About 248.1310, exactly 3√6841.
Is 61569 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 61569?
It is a composite number with 6 divisors.