The number 4963
4963 is a composite number with 4 divisors. Its prime factorisation is 7 × 709. Divisors (4): 1, 7, 709, 4963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4963: a semiprime: 7 × 709, the product of two primes.
- 2
4963 is composite. Its prime factorisation is
- 3
The divisors add up to 5680; without 4963 itself that is 717, so 4963 is deficient (717 is less than 4963). Euler's totient φ(4963) = 4248 numbers up to 4963 share no factor with it.
- 4
The digits of 4963 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4963 = 7 \times 709 \]
4963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5680 |
| Euler totient φ(n) | 4248 |
| Square | 24631369 |
| Cube | 122245484347 |
| Square root | 70.448563 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 41 |
| Scientific notation | 4.963 × |
4963 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and sixty-three |
| Binary (base 2) | 1001101100011 |
| Octal (base 8) | 11543 |
| Hexadecimal (base 16) | 1363 |
| Base 3 | 20210211 |
| As time | 4963 seconds = 1 h 22 min 43 s |
Is 4963 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 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (4963 ÷ 7 = 709) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4963 a prime number?
No. 4963 = 7 × 709, so it is divisible by 7.
What are the factors of 4963?
1, 7, 709, 4963.
What is 4963 in binary?
1001101100011 (hexadecimal 1363, octal 11543).
What is the square root of 4963?
About 70.4486.
Is 4963 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 4963?
4963 is a semiprime: 7 × 709, the product of two primes.