The number 49309
49309 is a composite number with 4 divisors. Its prime factorisation is 13 × 3793. Divisors (4): 1, 13, 3793, 49309.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49309: a semiprime: 13 × 3793, the product of two primes.
- 2
49309 is composite. Its prime factorisation is
- 3
The divisors add up to 53116; without 49309 itself that is 3807, so 49309 is deficient (3807 is less than 49309). Euler's totient φ(49309) = 45504 numbers up to 49309 share no factor with it.
- 4
The digits of 49309 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49309 = 13 \times 3793 \]
49309 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53116 |
| Euler totient φ(n) | 45504 |
| Square | 2431377481 |
| Cube | 119888792210629 |
| Square root | 222.056299 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9309 × |
49309 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and nine |
| Binary (base 2) | 1100000010011101 |
| Octal (base 8) | 140235 |
| Hexadecimal (base 16) | C09D |
| Base 3 | 2111122021 |
| As time | 49309 seconds = 13 h 41 min 49 s |
Is 49309 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 4) | 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 1) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 49309 a prime number?
No. 49309 = 13 × 3793, so it is divisible by 13.
What are the factors of 49309?
1, 13, 3793, 49309.
What is 49309 in binary?
1100000010011101 (hexadecimal C09D, octal 140235).
What is the square root of 49309?
About 222.0563.
Is 49309 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49309?
49309 is a semiprime: 13 × 3793, the product of two primes.