The number 49321
49321 is a composite number with 8 divisors. Its prime factorisation is 31 × 37 × 43. Divisors (8): 1, 31, 37, 43, 1147, 1333, 1591, 49321.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49321 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49321 is composite. Its prime factorisation is
- 3
The divisors add up to 53504; without 49321 itself that is 4183, so 49321 is deficient (4183 is less than 49321). Euler's totient φ(49321) = 45360 numbers up to 49321 share no factor with it.
- 4
The digits of 49321 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49321 = 31 \times 37 \times 43 \]
49321 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 53504 |
| Euler totient φ(n) | 45360 |
| Square | 2432561041 |
| Cube | 119976343103161 |
| Square root | 222.083318 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9321 × |
49321 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and twenty-one |
| Binary (base 2) | 1100000010101001 |
| Octal (base 8) | 140251 |
| Hexadecimal (base 16) | C0A9 |
| Base 3 | 2111122201 |
| As time | 49321 seconds = 13 h 42 min 1 s |
Is 49321 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 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 6) | 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 1) | 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 8) | 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 49321 a prime number?
No. 49321 = 31 × 37 × 43, so it is divisible by 31.
What are the factors of 49321?
1, 31, 37, 43, 1147, 1333, 1591, 49321.
What is 49321 in binary?
1100000010101001 (hexadecimal C0A9, octal 140251).
What is the square root of 49321?
About 222.0833.
Is 49321 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 49321?
It is a composite number with 8 divisors.