The number 49364
49364 is a composite number with 24 divisors. Its prime factorisation is × 7 × 41 × 43. Divisors (24): 1, 2, 4, 7, 14, 28, 41, 43, 82, 86, 164, 172, 287, 301, 574, 602 … 49364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49364 is composite. Its prime factorisation is
- 3
The divisors add up to 103488; without 49364 itself that is 54124, so 49364 is abundant (54124 is more than 49364). Euler's totient φ(49364) = 20160 numbers up to 49364 share no factor with it.
- 4
The digits of 49364 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49364 = 2^{2} \times 7 \times 41 \times 43 \]49364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 103488 |
| Euler totient φ(n) | 20160 |
| Square | 2436804496 |
| Cube | 120290417140544 |
| Square root | 222.180107 (= 2√12341) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9364 × |
49364 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and sixty-four |
| Binary (base 2) | 1100000011010100 |
| Octal (base 8) | 140324 |
| Hexadecimal (base 16) | C0D4 |
| Base 3 | 2111201022 |
| As time | 49364 seconds = 13 h 42 min 44 s |
Is 49364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49364 ÷ 2 = 24682) | 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 | Yes (49364 ÷ 4 = 12341) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49364 ÷ 7 = 7052) | 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 4) | 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 4) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49364 a prime number?
No. 49364 = × 7 × 41 × 43, so it is divisible by 2.
What are the factors of 49364?
1, 2, 4, 7, 14, 28, 41, 43, 82, 86, 164, 172, 287, 301, 574, 602, 1148, 1204, 1763, 3526, 7052, 12341, 24682, 49364.
What is 49364 in binary?
1100000011010100 (hexadecimal C0D4, octal 140324).
What is the square root of 49364?
About 222.1801, exactly 2√12341.
Is 49364 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49364?
It is a composite number with 24 divisors.