The number 63568
63568 is a composite number with 20 divisors. Its prime factorisation is × 29 × 137. Divisors (20): 1, 2, 4, 8, 16, 29, 58, 116, 137, 232, 274, 464, 548, 1096, 2192, 3973 … 63568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63568 is composite. Its prime factorisation is
- 3
The divisors add up to 128340; without 63568 itself that is 64772, so 63568 is abundant (64772 is more than 63568). Euler's totient φ(63568) = 30464 numbers up to 63568 share no factor with it.
- 4
The digits of 63568 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63568 = 2^{4} \times 29 \times 137 \]63568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 128340 |
| Euler totient φ(n) | 30464 |
| Square | 4040890624 |
| Cube | 256871335186432 |
| Square root | 252.126952 (= 4√3973) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 99 |
| Scientific notation | 6.3568 × |
63568 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand five hundred and sixty-eight |
| Binary (base 2) | 1111100001010000 |
| Octal (base 8) | 174120 |
| Hexadecimal (base 16) | F850 |
| Base 3 | 10020012101 |
| As time | 63568 seconds = 17 h 39 min 28 s |
Is 63568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63568 ÷ 2 = 31784) | 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 | Yes (63568 ÷ 4 = 15892) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (63568 ÷ 8 = 7946) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63568 a prime number?
No. 63568 = × 29 × 137, so it is divisible by 2.
What are the factors of 63568?
1, 2, 4, 8, 16, 29, 58, 116, 137, 232, 274, 464, 548, 1096, 2192, 3973, 7946, 15892, 31784, 63568.
What is 63568 in binary?
1111100001010000 (hexadecimal F850, octal 174120).
What is the square root of 63568?
About 252.1270, exactly 4√3973.
Is 63568 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 63568?
It is a composite number with 20 divisors.