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