The number 63450
63450 is a composite number with 48 divisors. Its prime factorisation is 2 × × × 47. Divisors (48): 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 30, 45, 47, 50, 54 … 63450.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63450: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
63450 is composite. Its prime factorisation is
- 3
The divisors add up to 178560; without 63450 itself that is 115110, so 63450 is abundant (115110 is more than 63450). Euler's totient φ(63450) = 16560 numbers up to 63450 share no factor with it.
- 4
The digits of 63450 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63450 = 2 \times 3^{3} \times 5^{2} \times 47 \]63450 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 178560 |
| Euler totient φ(n) | 16560 |
| Square | 4025902500 |
| Cube | 255443513625000 |
| Square root | 251.892834 (= 15√282) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 6.345 × |
63450 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand four hundred and fifty |
| Binary (base 2) | 1111011111011010 |
| Octal (base 8) | 173732 |
| Hexadecimal (base 16) | F7DA |
| Base 3 | 10020001000 |
| As time | 63450 seconds = 17 h 37 min 30 s |
Is 63450 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63450 ÷ 2 = 31725) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (63450 ÷ 3 = 21150) | 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 (63450 ÷ 5 = 12690) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (63450 ÷ 6 = 10575) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (63450 ÷ 9 = 7050) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (63450 ÷ 10 = 6345) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 63450 a prime number?
No. 63450 = 2 × × × 47, so it is divisible by 2.
What are the factors of 63450?
1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 30, 45, 47, 50, 54, 75, 90, 94, 135, 141, 150, 225, 235, 270, 282, 423, 450, 470, 675, 705, 846, 1175, 1269, 1350, 1410, 2115, 2350, 2538, 3525, 4230, 6345, 7050, 10575, 12690, 21150, 31725, 63450.
What is 63450 in binary?
1111011111011010 (hexadecimal F7DA, octal 173732).
What is the square root of 63450?
About 251.8928, exactly 15√282.
Is 63450 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 63450?
63450 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.