The number 63959
63959 is a composite number with 4 divisors. Its prime factorisation is 7 × 9137. Divisors (4): 1, 7, 9137, 63959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63959: a semiprime: 7 × 9137, the product of two primes.
- 2
63959 is composite. Its prime factorisation is
- 3
The divisors add up to 73104; without 63959 itself that is 9145, so 63959 is deficient (9145 is less than 63959). Euler's totient φ(63959) = 54816 numbers up to 63959 share no factor with it.
- 4
The digits of 63959 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63959 = 7 \times 9137 \]
63959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 73104 |
| Euler totient φ(n) | 54816 |
| Square | 4090753681 |
| Cube | 261640514683079 |
| Square root | 252.901166 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 99 |
| Scientific notation | 6.3959 × |
63959 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand nine hundred and fifty-nine |
| Binary (base 2) | 1111100111010111 |
| Octal (base 8) | 174727 |
| Hexadecimal (base 16) | F9D7 |
| Base 3 | 10020201212 |
| As time | 63959 seconds = 17 h 45 min 59 s |
Is 63959 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (63959 ÷ 7 = 9137) | 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 7) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63959 a prime number?
No. 63959 = 7 × 9137, so it is divisible by 7.
What are the factors of 63959?
1, 7, 9137, 63959.
What is 63959 in binary?
1111100111010111 (hexadecimal F9D7, octal 174727).
What is the square root of 63959?
About 252.9012.
Is 63959 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 63959?
63959 is a semiprime: 7 × 9137, the product of two primes.