The number 48961
48961 is a composite number with 4 divisors. Its prime factorisation is 11 × 4451. Divisors (4): 1, 11, 4451, 48961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48961: a semiprime: 11 × 4451, the product of two primes.
- 2
48961 is composite. Its prime factorisation is
- 3
The divisors add up to 53424; without 48961 itself that is 4463, so 48961 is deficient (4463 is less than 48961). Euler's totient φ(48961) = 44500 numbers up to 48961 share no factor with it.
- 4
The digits of 48961 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48961 = 11 \times 4451 \]
48961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53424 |
| Euler totient φ(n) | 44500 |
| Square | 2397179521 |
| Cube | 117368306527681 |
| Square root | 221.271327 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8961 × |
48961 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and sixty-one |
| Binary (base 2) | 1011111101000001 |
| Octal (base 8) | 137501 |
| Hexadecimal (base 16) | BF41 |
| Base 3 | 2111011101 |
| As time | 48961 seconds = 13 h 36 min 1 s |
Is 48961 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 3) | 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 1) | 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 | Yes (48961 ÷ 11 = 4451) | 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 48961 a prime number?
No. 48961 = 11 × 4451, so it is divisible by 11.
What are the factors of 48961?
1, 11, 4451, 48961.
What is 48961 in binary?
1011111101000001 (hexadecimal BF41, octal 137501).
What is the square root of 48961?
About 221.2713.
Is 48961 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 48961?
48961 is a semiprime: 11 × 4451, the product of two primes.