The number 49237
49237 is a composite number with 4 divisors. Its prime factorisation is 53 × 929. Divisors (4): 1, 53, 929, 49237.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49237: a semiprime: 53 × 929, the product of two primes.
- 2
49237 is composite. Its prime factorisation is
- 3
The divisors add up to 50220; without 49237 itself that is 983, so 49237 is deficient (983 is less than 49237). Euler's totient φ(49237) = 48256 numbers up to 49237 share no factor with it.
- 4
The digits of 49237 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49237 = 53 \times 929 \]
49237 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50220 |
| Euler totient φ(n) | 48256 |
| Square | 2424282169 |
| Cube | 119364381155053 |
| Square root | 221.894119 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9237 × |
49237 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and thirty-seven |
| Binary (base 2) | 1100000001010101 |
| Octal (base 8) | 140125 |
| Hexadecimal (base 16) | C055 |
| Base 3 | 2111112121 |
| As time | 49237 seconds = 13 h 40 min 37 s |
Is 49237 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 2) | 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 6) | 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 7) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49237 a prime number?
No. 49237 = 53 × 929, so it is divisible by 53.
What are the factors of 49237?
1, 53, 929, 49237.
What is 49237 in binary?
1100000001010101 (hexadecimal C055, octal 140125).
What is the square root of 49237?
About 221.8941.
Is 49237 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49237?
49237 is a semiprime: 53 × 929, the product of two primes.