The number 49381
49381 is a composite number with 8 divisors. Its prime factorisation is 19 × 23 × 113. Divisors (8): 1, 19, 23, 113, 437, 2147, 2599, 49381.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49381 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49381 is composite. Its prime factorisation is
- 3
The divisors add up to 54720; without 49381 itself that is 5339, so 49381 is deficient (5339 is less than 49381). Euler's totient φ(49381) = 44352 numbers up to 49381 share no factor with it.
- 4
The digits of 49381 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49381 = 19 \times 23 \times 113 \]
49381 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 54720 |
| Euler totient φ(n) | 44352 |
| Square | 2438483161 |
| Cube | 120414736973341 |
| Square root | 222.218361 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9381 × |
49381 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and eighty-one |
| Binary (base 2) | 1100000011100101 |
| Octal (base 8) | 140345 |
| Hexadecimal (base 16) | C0E5 |
| Base 3 | 2111201221 |
| As time | 49381 seconds = 13 h 43 min 1 s |
Is 49381 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49381 a prime number?
No. 49381 = 19 × 23 × 113, so it is divisible by 19.
What are the factors of 49381?
1, 19, 23, 113, 437, 2147, 2599, 49381.
What is 49381 in binary?
1100000011100101 (hexadecimal C0E5, octal 140345).
What is the square root of 49381?
About 222.2184.
Is 49381 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49381?
It is a composite number with 8 divisors.