The number 63990
63990 is a composite number with 40 divisors. Its prime factorisation is 2 × × 5 × 79. Divisors (40): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 79, 81, 90 … 63990.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63990: a Harshad number: divisible by its digit sum 27.
- 2
63990 is composite. Its prime factorisation is
- 3
The divisors add up to 174240; without 63990 itself that is 110250, so 63990 is abundant (110250 is more than 63990). Euler's totient φ(63990) = 16848 numbers up to 63990 share no factor with it.
- 4
The digits of 63990 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63990 = 2 \times 3^{4} \times 5 \times 79 \]63990 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 174240 |
| Euler totient φ(n) | 16848 |
| Square | 4094720100 |
| Cube | 262021139199000 |
| Square root | 252.962448 (= 9√790) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 99 |
| Scientific notation | 6.399 × |
63990 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand nine hundred and ninety |
| Binary (base 2) | 1111100111110110 |
| Octal (base 8) | 174766 |
| Hexadecimal (base 16) | F9F6 |
| Base 3 | 10020210000 |
| As time | 63990 seconds = 17 h 46 min 30 s |
Is 63990 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63990 ÷ 2 = 31995) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (63990 ÷ 3 = 21330) | 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 (63990 ÷ 5 = 12798) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (63990 ÷ 6 = 10665) | 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 | Yes (63990 ÷ 9 = 7110) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (63990 ÷ 10 = 6399) | 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 63990 a prime number?
No. 63990 = 2 × × 5 × 79, so it is divisible by 2.
What are the factors of 63990?
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 79, 81, 90, 135, 158, 162, 237, 270, 395, 405, 474, 711, 790, 810, 1185, 1422, 2133, 2370, 3555, 4266, 6399, 7110, 10665, 12798, 21330, 31995, 63990.
What is 63990 in binary?
1111100111110110 (hexadecimal F9F6, octal 174766).
What is the square root of 63990?
About 252.9624, exactly 9√790.
Is 63990 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 63990?
63990 is a Harshad number: divisible by its digit sum 27.