The number 49137
49137 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1489. Divisors (8): 1, 3, 11, 33, 1489, 4467, 16379, 49137.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49137 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49137 is composite. Its prime factorisation is
- 3
The divisors add up to 71520; without 49137 itself that is 22383, so 49137 is deficient (22383 is less than 49137). Euler's totient φ(49137) = 29760 numbers up to 49137 share no factor with it.
- 4
The digits of 49137 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49137 = 3 \times 11 \times 1489 \]
49137 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71520 |
| Euler totient φ(n) | 29760 |
| Square | 2414444769 |
| Cube | 118638572614353 |
| Square root | 221.668672 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9137 × |
49137 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and thirty-seven |
| Binary (base 2) | 1011111111110001 |
| Octal (base 8) | 137761 |
| Hexadecimal (base 16) | BFF1 |
| Base 3 | 2111101220 |
| As time | 49137 seconds = 13 h 38 min 57 s |
Is 49137 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 | Yes (49137 ÷ 3 = 16379) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49137 ÷ 11 = 4467) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49137 a prime number?
No. 49137 = 3 × 11 × 1489, so it is divisible by 3.
What are the factors of 49137?
1, 3, 11, 33, 1489, 4467, 16379, 49137.
What is 49137 in binary?
1011111111110001 (hexadecimal BFF1, octal 137761).
What is the square root of 49137?
About 221.6687.
Is 49137 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49137?
It is a composite number with 8 divisors.