The number 63
63 is a binary palindrome (111111). Its prime factorisation is × 7. Divisors (6): 1, 3, 7, 9, 21, 63.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63: a binary palindrome (111111); a Harshad number: divisible by its digit sum 9.
- 2
63 is composite. Its prime factorisation is
- 3
The divisors add up to 104; without 63 itself that is 41, so 63 is deficient (41 is less than 63). Euler's totient φ(63) = 36 numbers up to 63 share no factor with it.
- 4
The digits of 63 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63 = 3^{2} \times 7 \]63 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 104 |
| Euler totient φ(n) | 36 |
| Square | 3969 |
| Cube | 250047 |
| Square root | 7.937254 (= 3√7) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 107 |
| Scientific notation | 6.3 × |
63 in other forms
| Form | Value |
|---|---|
| In words | sixty-three |
| Roman numerals | LXIII |
| Binary (base 2) | 111111 |
| Octal (base 8) | 77 |
| Hexadecimal (base 16) | 3F |
| Base 3 | 2100 |
| As time | 63 seconds = 1 min 3 s |
Is 63 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 (63 ÷ 3 = 21) | 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 3) | 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 (63 ÷ 7 = 9) | 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 (63 ÷ 9 = 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63 a prime number?
No. 63 = × 7, so it is divisible by 3.
What are the factors of 63?
1, 3, 7, 9, 21, 63.
What is 63 in binary?
111111 (hexadecimal 3F, octal 77).
What is the square root of 63?
About 7.9373, exactly 3√7.
What is 63 in Roman numerals?
LXIII.
Is 63 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 63?
63 is a binary palindrome (111111); a Harshad number: divisible by its digit sum 9.