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