The number 49093
49093 is a composite number with 4 divisors. Its prime factorisation is 11 × 4463. Divisors (4): 1, 11, 4463, 49093.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49093: a semiprime: 11 × 4463, the product of two primes.
- 2
49093 is composite. Its prime factorisation is
- 3
The divisors add up to 53568; without 49093 itself that is 4475, so 49093 is deficient (4475 is less than 49093). Euler's totient φ(49093) = 44620 numbers up to 49093 share no factor with it.
- 4
The digits of 49093 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
\[ 49093 = 11 \times 4463 \]
49093 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53568 |
| Euler totient φ(n) | 44620 |
| Square | 2410122649 |
| Cube | 118320151207357 |
| Square root | 221.569402 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9093 × |
49093 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and ninety-three |
| Binary (base 2) | 1011111111000101 |
| Octal (base 8) | 137705 |
| Hexadecimal (base 16) | BFC5 |
| Base 3 | 2111100021 |
| As time | 49093 seconds = 13 h 38 min 13 s |
Is 49093 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 3) | 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 2) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49093 ÷ 11 = 4463) | 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 49093 a prime number?
No. 49093 = 11 × 4463, so it is divisible by 11.
What are the factors of 49093?
1, 11, 4463, 49093.
What is 49093 in binary?
1011111111000101 (hexadecimal BFC5, octal 137705).
What is the square root of 49093?
About 221.5694.
Is 49093 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49093?
49093 is a semiprime: 11 × 4463, the product of two primes.