The number 49313
49313 is a composite number with 4 divisors. Its prime factorisation is 11 × 4483. Divisors (4): 1, 11, 4483, 49313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49313: a semiprime: 11 × 4483, the product of two primes.
- 2
49313 is composite. Its prime factorisation is
- 3
The divisors add up to 53808; without 49313 itself that is 4495, so 49313 is deficient (4495 is less than 49313). Euler's totient φ(49313) = 44820 numbers up to 49313 share no factor with it.
- 4
The digits of 49313 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49313 = 11 \times 4483 \]
49313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53808 |
| Euler totient φ(n) | 44820 |
| Square | 2431771969 |
| Cube | 119917971107297 |
| Square root | 222.065306 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9313 × |
49313 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and thirteen |
| Binary (base 2) | 1100000010100001 |
| Octal (base 8) | 140241 |
| Hexadecimal (base 16) | C0A1 |
| Base 3 | 2111122102 |
| As time | 49313 seconds = 13 h 41 min 53 s |
Is 49313 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 2) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 (49313 ÷ 11 = 4483) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49313 a prime number?
No. 49313 = 11 × 4483, so it is divisible by 11.
What are the factors of 49313?
1, 11, 4483, 49313.
What is 49313 in binary?
1100000010100001 (hexadecimal C0A1, octal 140241).
What is the square root of 49313?
About 222.0653.
Is 49313 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49313?
49313 is a semiprime: 11 × 4483, the product of two primes.