The number 63390
63390 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2113. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2113, 4226, 6339, 10565, 12678, 21130, 31695, 63390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63390 is composite. Its prime factorisation is
- 3
The divisors add up to 152208; without 63390 itself that is 88818, so 63390 is abundant (88818 is more than 63390). Euler's totient φ(63390) = 16896 numbers up to 63390 share no factor with it.
- 4
The digits of 63390 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63390 = 2 \times 3 \times 5 \times 2113 \]
63390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 152208 |
| Euler totient φ(n) | 16896 |
| Square | 4018292100 |
| Cube | 254719536219000 |
| Square root | 251.773708 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 6.339 × |
63390 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand three hundred and ninety |
| Binary (base 2) | 1111011110011110 |
| Octal (base 8) | 173636 |
| Hexadecimal (base 16) | F79E |
| Base 3 | 10012221210 |
| As time | 63390 seconds = 17 h 36 min 30 s |
Is 63390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63390 ÷ 2 = 31695) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (63390 ÷ 3 = 21130) | 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 (63390 ÷ 5 = 12678) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (63390 ÷ 6 = 10565) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (63390 ÷ 10 = 6339) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63390 a prime number?
No. 63390 = 2 × 3 × 5 × 2113, so it is divisible by 2.
What are the factors of 63390?
1, 2, 3, 5, 6, 10, 15, 30, 2113, 4226, 6339, 10565, 12678, 21130, 31695, 63390.
What is 63390 in binary?
1111011110011110 (hexadecimal F79E, octal 173636).
What is the square root of 63390?
About 251.7737.
Is 63390 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 63390?
It is a composite number with 16 divisors.