The number 48963
48963 is a composite number with 8 divisors. Its prime factorisation is 3 × 19 × 859. Divisors (8): 1, 3, 19, 57, 859, 2577, 16321, 48963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48963 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48963 is composite. Its prime factorisation is
- 3
The divisors add up to 68800; without 48963 itself that is 19837, so 48963 is deficient (19837 is less than 48963). Euler's totient φ(48963) = 30888 numbers up to 48963 share no factor with it.
- 4
The digits of 48963 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48963 = 3 \times 19 \times 859 \]
48963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68800 |
| Euler totient φ(n) | 30888 |
| Square | 2397375369 |
| Cube | 117382690192347 |
| Square root | 221.275846 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8963 × |
48963 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and sixty-three |
| Binary (base 2) | 1011111101000011 |
| Octal (base 8) | 137503 |
| Hexadecimal (base 16) | BF43 |
| Base 3 | 2111011110 |
| As time | 48963 seconds = 13 h 36 min 3 s |
Is 48963 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 | Yes (48963 ÷ 3 = 16321) | 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 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48963 a prime number?
No. 48963 = 3 × 19 × 859, so it is divisible by 3.
What are the factors of 48963?
1, 3, 19, 57, 859, 2577, 16321, 48963.
What is 48963 in binary?
1011111101000011 (hexadecimal BF43, octal 137503).
What is the square root of 48963?
About 221.2758.
Is 48963 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 48963?
It is a composite number with 8 divisors.