The number 49138
49138 is a composite number with 8 divisors. Its prime factorisation is 2 × 79 × 311. Divisors (8): 1, 2, 79, 158, 311, 622, 24569, 49138.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49138 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49138 is composite. Its prime factorisation is
- 3
The divisors add up to 74880; without 49138 itself that is 25742, so 49138 is deficient (25742 is less than 49138). Euler's totient φ(49138) = 24180 numbers up to 49138 share no factor with it.
- 4
The digits of 49138 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49138 = 2 \times 79 \times 311 \]
49138 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74880 |
| Euler totient φ(n) | 24180 |
| Square | 2414543044 |
| Cube | 118645816096072 |
| Square root | 221.670927 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 171 |
| Scientific notation | 4.9138 × |
49138 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and thirty-eight |
| Binary (base 2) | 1011111111110010 |
| Octal (base 8) | 137762 |
| Hexadecimal (base 16) | BFF2 |
| Base 3 | 2111101221 |
| As time | 49138 seconds = 13 h 38 min 58 s |
Is 49138 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49138 ÷ 2 = 24569) | 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 2) | 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 4) | 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 2) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49138 a prime number?
No. 49138 = 2 × 79 × 311, so it is divisible by 2.
What are the factors of 49138?
1, 2, 79, 158, 311, 622, 24569, 49138.
What is 49138 in binary?
1011111111110010 (hexadecimal BFF2, octal 137762).
What is the square root of 49138?
About 221.6709.
Is 49138 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49138?
It is a composite number with 8 divisors.