The number 63567
63567 is a composite number with 12 divisors. Its prime factorisation is × 7 × 1009. Divisors (12): 1, 3, 7, 9, 21, 63, 1009, 3027, 7063, 9081, 21189, 63567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63567 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63567 is composite. Its prime factorisation is
- 3
The divisors add up to 105040; without 63567 itself that is 41473, so 63567 is deficient (41473 is less than 63567). Euler's totient φ(63567) = 36288 numbers up to 63567 share no factor with it.
- 4
The digits of 63567 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63567 = 3^{2} \times 7 \times 1009 \]63567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 105040 |
| Euler totient φ(n) | 36288 |
| Square | 4040763489 |
| Cube | 256859212705263 |
| Square root | 252.124969 (= 3√7063) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.3567 × |
63567 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand five hundred and sixty-seven |
| Binary (base 2) | 1111100001001111 |
| Octal (base 8) | 174117 |
| Hexadecimal (base 16) | F84F |
| Base 3 | 10020012100 |
| As time | 63567 seconds = 17 h 39 min 27 s |
Is 63567 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 (63567 ÷ 3 = 21189) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 | Yes (63567 ÷ 7 = 9081) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (63567 ÷ 9 = 7063) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63567 a prime number?
No. 63567 = × 7 × 1009, so it is divisible by 3.
What are the factors of 63567?
1, 3, 7, 9, 21, 63, 1009, 3027, 7063, 9081, 21189, 63567.
What is 63567 in binary?
1111100001001111 (hexadecimal F84F, octal 174117).
What is the square root of 63567?
About 252.1250, exactly 3√7063.
Is 63567 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 63567?
It is a composite number with 12 divisors.