The number 49301
49301 is a composite number with 4 divisors. Its prime factorisation is 7 × 7043. Divisors (4): 1, 7, 7043, 49301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49301: a semiprime: 7 × 7043, the product of two primes.
- 2
49301 is composite. Its prime factorisation is
- 3
The divisors add up to 56352; without 49301 itself that is 7051, so 49301 is deficient (7051 is less than 49301). Euler's totient φ(49301) = 42252 numbers up to 49301 share no factor with it.
- 4
The digits of 49301 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49301 = 7 \times 7043 \]
49301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56352 |
| Euler totient φ(n) | 42252 |
| Square | 2430588601 |
| Cube | 119830448617901 |
| Square root | 222.038285 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9301 × |
49301 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and one |
| Binary (base 2) | 1100000010010101 |
| Octal (base 8) | 140225 |
| Hexadecimal (base 16) | C095 |
| Base 3 | 2111121222 |
| As time | 49301 seconds = 13 h 41 min 41 s |
Is 49301 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 1) | 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 | Yes (49301 ÷ 7 = 7043) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 49301 a prime number?
No. 49301 = 7 × 7043, so it is divisible by 7.
What are the factors of 49301?
1, 7, 7043, 49301.
What is 49301 in binary?
1100000010010101 (hexadecimal C095, octal 140225).
What is the square root of 49301?
About 222.0383.
Is 49301 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 49301?
49301 is a semiprime: 7 × 7043, the product of two primes.