The number 63950
63950 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1279. Divisors (12): 1, 2, 5, 10, 25, 50, 1279, 2558, 6395, 12790, 31975, 63950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63950 is composite. Its prime factorisation is
- 3
The divisors add up to 119040; without 63950 itself that is 55090, so 63950 is deficient (55090 is less than 63950). Euler's totient φ(63950) = 25560 numbers up to 63950 share no factor with it.
- 4
The digits of 63950 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 192 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63950 = 2 \times 5^{2} \times 1279 \]63950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 119040 |
| Euler totient φ(n) | 25560 |
| Square | 4089602500 |
| Cube | 261530079875000 |
| Square root | 252.883372 (= 5√2558) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 192 |
| Scientific notation | 6.395 × |
63950 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand nine hundred and fifty |
| Binary (base 2) | 1111100111001110 |
| Octal (base 8) | 174716 |
| Hexadecimal (base 16) | F9CE |
| Base 3 | 10020201112 |
| As time | 63950 seconds = 17 h 45 min 50 s |
Is 63950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63950 ÷ 2 = 31975) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (63950 ÷ 5 = 12790) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (63950 ÷ 10 = 6395) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63950 a prime number?
No. 63950 = 2 × × 1279, so it is divisible by 2.
What are the factors of 63950?
1, 2, 5, 10, 25, 50, 1279, 2558, 6395, 12790, 31975, 63950.
What is 63950 in binary?
1111100111001110 (hexadecimal F9CE, octal 174716).
What is the square root of 63950?
About 252.8834, exactly 5√2558.
Is 63950 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 63950?
It is a composite number with 12 divisors.