The number 63150
63150 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 421. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 421, 842, 1263, 2105 … 63150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63150: a Harshad number: divisible by its digit sum 15.
- 2
63150 is composite. Its prime factorisation is
- 3
The divisors add up to 156984; without 63150 itself that is 93834, so 63150 is abundant (93834 is more than 63150). Euler's totient φ(63150) = 16800 numbers up to 63150 share no factor with it.
- 4
The digits of 63150 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63150 = 2 \times 3 \times 5^{2} \times 421 \]63150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 156984 |
| Euler totient φ(n) | 16800 |
| Square | 3987922500 |
| Cube | 251837305875000 |
| Square root | 251.296637 (= 5√2526) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.315 × |
63150 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand one hundred and fifty |
| Binary (base 2) | 1111011010101110 |
| Octal (base 8) | 173256 |
| Hexadecimal (base 16) | F6AE |
| Base 3 | 10012121220 |
| As time | 63150 seconds = 17 h 32 min 30 s |
Is 63150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63150 ÷ 2 = 31575) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (63150 ÷ 3 = 21050) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (63150 ÷ 5 = 12630) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (63150 ÷ 6 = 10525) | 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (63150 ÷ 10 = 6315) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63150 a prime number?
No. 63150 = 2 × 3 × × 421, so it is divisible by 2.
What are the factors of 63150?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 421, 842, 1263, 2105, 2526, 4210, 6315, 10525, 12630, 21050, 31575, 63150.
What is 63150 in binary?
1111011010101110 (hexadecimal F6AE, octal 173256).
What is the square root of 63150?
About 251.2966, exactly 5√2526.
Is 63150 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 63150?
63150 is a Harshad number: divisible by its digit sum 15.