The number 49361
49361 is a composite number with 4 divisors. Its prime factorisation is 13 × 3797. Divisors (4): 1, 13, 3797, 49361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49361: a semiprime: 13 × 3797, the product of two primes.
- 2
49361 is composite. Its prime factorisation is
- 3
The divisors add up to 53172; without 49361 itself that is 3811, so 49361 is deficient (3811 is less than 49361). Euler's totient φ(49361) = 45552 numbers up to 49361 share no factor with it.
- 4
The digits of 49361 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49361 = 13 \times 3797 \]
49361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53172 |
| Euler totient φ(n) | 45552 |
| Square | 2436508321 |
| Cube | 120268487232881 |
| Square root | 222.173356 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9361 × |
49361 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and sixty-one |
| Binary (base 2) | 1100000011010001 |
| Octal (base 8) | 140321 |
| Hexadecimal (base 16) | C0D1 |
| Base 3 | 2111201012 |
| As time | 49361 seconds = 13 h 42 min 41 s |
Is 49361 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 | No (remainder 4) | 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 5) | 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 4) | 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 49361 a prime number?
No. 49361 = 13 × 3797, so it is divisible by 13.
What are the factors of 49361?
1, 13, 3797, 49361.
What is 49361 in binary?
1100000011010001 (hexadecimal C0D1, octal 140321).
What is the square root of 49361?
About 222.1734.
Is 49361 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49361?
49361 is a semiprime: 13 × 3797, the product of two primes.