The number 63330
63330 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2111. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2111, 4222, 6333, 10555, 12666, 21110, 31665, 63330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63330: a Harshad number: divisible by its digit sum 15.
- 2
63330 is composite. Its prime factorisation is
- 3
The divisors add up to 152064; without 63330 itself that is 88734, so 63330 is abundant (88734 is more than 63330). Euler's totient φ(63330) = 16880 numbers up to 63330 share no factor with it.
- 4
The digits of 63330 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 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63330 = 2 \times 3 \times 5 \times 2111 \]
63330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 152064 |
| Euler totient φ(n) | 16880 |
| Square | 4010688900 |
| Cube | 253996928037000 |
| Square root | 251.654525 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.333 × |
63330 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand three hundred and thirty |
| Binary (base 2) | 1111011101100010 |
| Octal (base 8) | 173542 |
| Hexadecimal (base 16) | F762 |
| Base 3 | 10012212120 |
| As time | 63330 seconds = 17 h 35 min 30 s |
Is 63330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63330 ÷ 2 = 31665) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (63330 ÷ 3 = 21110) | 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 (63330 ÷ 5 = 12666) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (63330 ÷ 6 = 10555) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (63330 ÷ 10 = 6333) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 63330 a prime number?
No. 63330 = 2 × 3 × 5 × 2111, so it is divisible by 2.
What are the factors of 63330?
1, 2, 3, 5, 6, 10, 15, 30, 2111, 4222, 6333, 10555, 12666, 21110, 31665, 63330.
What is 63330 in binary?
1111011101100010 (hexadecimal F762, octal 173542).
What is the square root of 63330?
About 251.6545.
Is 63330 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 63330?
63330 is a Harshad number: divisible by its digit sum 15.