The number 48941
48941 is a composite number with 4 divisors. Its prime factorisation is 109 × 449. Divisors (4): 1, 109, 449, 48941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48941: a semiprime: 109 × 449, the product of two primes.
- 2
48941 is composite. Its prime factorisation is
- 3
The divisors add up to 49500; without 48941 itself that is 559, so 48941 is deficient (559 is less than 48941). Euler's totient φ(48941) = 48384 numbers up to 48941 share no factor with it.
- 4
The digits of 48941 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48941 = 109 \times 449 \]
48941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49500 |
| Euler totient φ(n) | 48384 |
| Square | 2395221481 |
| Cube | 117224534501621 |
| Square root | 221.226129 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.8941 × |
48941 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and forty-one |
| Binary (base 2) | 1011111100101101 |
| Octal (base 8) | 137455 |
| Hexadecimal (base 16) | BF2D |
| Base 3 | 2111010122 |
| As time | 48941 seconds = 13 h 35 min 41 s |
Is 48941 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 1) | 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 4) | 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 5) | 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 1) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48941 a prime number?
No. 48941 = 109 × 449, so it is divisible by 109.
What are the factors of 48941?
1, 109, 449, 48941.
What is 48941 in binary?
1011111100101101 (hexadecimal BF2D, octal 137455).
What is the square root of 48941?
About 221.2261.
Is 48941 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 48941?
48941 is a semiprime: 109 × 449, the product of two primes.