The number 61568
61568 is a composite number with 32 divisors. Its prime factorisation is × 13 × 37. Divisors (32): 1, 2, 4, 8, 13, 16, 26, 32, 37, 52, 64, 74, 104, 128, 148, 208 … 61568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61568: a Harshad number: divisible by its digit sum 26.
- 2
61568 is composite. Its prime factorisation is
- 3
The divisors add up to 135660; without 61568 itself that is 74092, so 61568 is abundant (74092 is more than 61568). Euler's totient φ(61568) = 27648 numbers up to 61568 share no factor with it.
- 4
The digits of 61568 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61568 = 2^{7} \times 13 \times 37 \]61568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 135660 |
| Euler totient φ(n) | 27648 |
| Square | 3790618624 |
| Cube | 233380807442432 |
| Square root | 248.128999 (= 8√962) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.1568 × |
61568 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and sixty-eight |
| Binary (base 2) | 1111000010000000 |
| Octal (base 8) | 170200 |
| Hexadecimal (base 16) | F080 |
| Base 3 | 10010110022 |
| As time | 61568 seconds = 17 h 6 min 8 s |
Is 61568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61568 ÷ 2 = 30784) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (61568 ÷ 4 = 15392) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | Yes (61568 ÷ 8 = 7696) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61568 a prime number?
No. 61568 = × 13 × 37, so it is divisible by 2.
What are the factors of 61568?
1, 2, 4, 8, 13, 16, 26, 32, 37, 52, 64, 74, 104, 128, 148, 208, 296, 416, 481, 592, 832, 962, 1184, 1664, 1924, 2368, 3848, 4736, 7696, 15392, 30784, 61568.
What is 61568 in binary?
1111000010000000 (hexadecimal F080, octal 170200).
What is the square root of 61568?
About 248.1290, exactly 8√962.
Is 61568 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 61568?
61568 is a Harshad number: divisible by its digit sum 26.