The number 49141
49141 is a triangular number: 1 + 2 + … + 313 = 49141. Its prime factorisation is 157 × 313. Divisors (4): 1, 157, 313, 49141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49141: a triangular number: 1 + 2 + … + 313 = 49141; a semiprime: 157 × 313, the product of two primes.
- 2
49141 is composite. Its prime factorisation is
- 3
The divisors add up to 49612; without 49141 itself that is 471, so 49141 is deficient (471 is less than 49141). Euler's totient φ(49141) = 48672 numbers up to 49141 share no factor with it.
- 4
The digits of 49141 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49141 = 157 \times 313 \]
49141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49612 |
| Euler totient φ(n) | 48672 |
| Square | 2414837881 |
| Cube | 118667548310221 |
| Square root | 221.677694 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9141 × |
49141 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and forty-one |
| Binary (base 2) | 1011111111110101 |
| Octal (base 8) | 137765 |
| Hexadecimal (base 16) | BFF5 |
| Base 3 | 2111102001 |
| As time | 49141 seconds = 13 h 39 min 1 s |
Is 49141 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 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 5) | 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 | No (remainder 4) | 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 49141 a prime number?
No. 49141 = 157 × 313, so it is divisible by 157.
What are the factors of 49141?
1, 157, 313, 49141.
What is 49141 in binary?
1011111111110101 (hexadecimal BFF5, octal 137765).
What is the square root of 49141?
About 221.6777.
Is 49141 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 49141?
49141 is a triangular number: 1 + 2 + … + 313 = 49141; a semiprime: 157 × 313, the product of two primes.