The number 63961
63961 is a composite number with 4 divisors. Its prime factorisation is 167 × 383. Divisors (4): 1, 167, 383, 63961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63961: a semiprime: 167 × 383, the product of two primes.
- 2
63961 is composite. Its prime factorisation is
- 3
The divisors add up to 64512; without 63961 itself that is 551, so 63961 is deficient (551 is less than 63961). Euler's totient φ(63961) = 63412 numbers up to 63961 share no factor with it.
- 4
The digits of 63961 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63961 = 167 \times 383 \]
63961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64512 |
| Euler totient φ(n) | 63412 |
| Square | 4091009521 |
| Cube | 261665059972681 |
| Square root | 252.905121 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.3961 × |
63961 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand nine hundred and sixty-one |
| Binary (base 2) | 1111100111011001 |
| Octal (base 8) | 174731 |
| Hexadecimal (base 16) | F9D9 |
| Base 3 | 10020201221 |
| As time | 63961 seconds = 17 h 46 min 1 s |
Is 63961 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63961 a prime number?
No. 63961 = 167 × 383, so it is divisible by 167.
What are the factors of 63961?
1, 167, 383, 63961.
What is 63961 in binary?
1111100111011001 (hexadecimal F9D9, octal 174731).
What is the square root of 63961?
About 252.9051.
Is 63961 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 63961?
63961 is a semiprime: 167 × 383, the product of two primes.