The number 49150
49150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 983. Divisors (12): 1, 2, 5, 10, 25, 50, 983, 1966, 4915, 9830, 24575, 49150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49150 is composite. Its prime factorisation is
- 3
The divisors add up to 91512; without 49150 itself that is 42362, so 49150 is deficient (42362 is less than 49150). Euler's totient φ(49150) = 19640 numbers up to 49150 share no factor with it.
- 4
The digits of 49150 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
\[ 49150 = 2 \times 5^{2} \times 983 \]49150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91512 |
| Euler totient φ(n) | 19640 |
| Square | 2415722500 |
| Cube | 118732760875000 |
| Square root | 221.697993 (= 5√1966) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.915 × |
49150 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and fifty |
| Binary (base 2) | 1011111111111110 |
| Octal (base 8) | 137776 |
| Hexadecimal (base 16) | BFFE |
| Base 3 | 2111102101 |
| As time | 49150 seconds = 13 h 39 min 10 s |
Is 49150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49150 ÷ 2 = 24575) | 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 | Yes (49150 ÷ 5 = 9830) | 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 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 6) | 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 | Yes (49150 ÷ 10 = 4915) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49150 a prime number?
No. 49150 = 2 × × 983, so it is divisible by 2.
What are the factors of 49150?
1, 2, 5, 10, 25, 50, 983, 1966, 4915, 9830, 24575, 49150.
What is 49150 in binary?
1011111111111110 (hexadecimal BFFE, octal 137776).
What is the square root of 49150?
About 221.6980, exactly 5√1966.
Is 49150 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 49150?
It is a composite number with 12 divisors.