The number 49449
49449 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 311. Divisors (8): 1, 3, 53, 159, 311, 933, 16483, 49449.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49449 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49449 is composite. Its prime factorisation is
- 3
The divisors add up to 67392; without 49449 itself that is 17943, so 49449 is deficient (17943 is less than 49449). Euler's totient φ(49449) = 32240 numbers up to 49449 share no factor with it.
- 4
The digits of 49449 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49449 = 3 \times 53 \times 311 \]
49449 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 67392 |
| Euler totient φ(n) | 32240 |
| Square | 2445203601 |
| Cube | 120912872865849 |
| Square root | 222.371311 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 171 |
| Scientific notation | 4.9449 × |
49449 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and forty-nine |
| Binary (base 2) | 1100000100101001 |
| Octal (base 8) | 140451 |
| Hexadecimal (base 16) | C129 |
| Base 3 | 2111211110 |
| As time | 49449 seconds = 13 h 44 min 9 s |
Is 49449 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 | Yes (49449 ÷ 3 = 16483) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49449 a prime number?
No. 49449 = 3 × 53 × 311, so it is divisible by 3.
What are the factors of 49449?
1, 3, 53, 159, 311, 933, 16483, 49449.
What is 49449 in binary?
1100000100101001 (hexadecimal C129, octal 140451).
What is the square root of 49449?
About 222.3713.
Is 49449 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49449?
It is a composite number with 8 divisors.