The number 63147
63147 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 31 × 97. Divisors (16): 1, 3, 7, 21, 31, 93, 97, 217, 291, 651, 679, 2037, 3007, 9021, 21049, 63147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63147: a Harshad number: divisible by its digit sum 21.
- 2
63147 is composite. Its prime factorisation is
- 3
The divisors add up to 100352; without 63147 itself that is 37205, so 63147 is deficient (37205 is less than 63147). Euler's totient φ(63147) = 34560 numbers up to 63147 share no factor with it.
- 4
The digits of 63147 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63147 = 3 \times 7 \times 31 \times 97 \]
63147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 100352 |
| Euler totient φ(n) | 34560 |
| Square | 3987543609 |
| Cube | 251801416277523 |
| Square root | 251.290668 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 6.3147 × |
63147 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand one hundred and forty-seven |
| Binary (base 2) | 1111011010101011 |
| Octal (base 8) | 173253 |
| Hexadecimal (base 16) | F6AB |
| Base 3 | 10012121210 |
| As time | 63147 seconds = 17 h 32 min 27 s |
Is 63147 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 (63147 ÷ 3 = 21049) | 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 (63147 ÷ 7 = 9021) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 7) | 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 63147 a prime number?
No. 63147 = 3 × 7 × 31 × 97, so it is divisible by 3.
What are the factors of 63147?
1, 3, 7, 21, 31, 93, 97, 217, 291, 651, 679, 2037, 3007, 9021, 21049, 63147.
What is 63147 in binary?
1111011010101011 (hexadecimal F6AB, octal 173253).
What is the square root of 63147?
About 251.2907.
Is 63147 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 63147?
63147 is a Harshad number: divisible by its digit sum 21.