The number 49005
49005 is a composite number with 30 divisors. Its prime factorisation is × 5 × . Divisors (30): 1, 3, 5, 9, 11, 15, 27, 33, 45, 55, 81, 99, 121, 135, 165, 297 … 49005.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49005 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49005 is composite. Its prime factorisation is
- 3
The divisors add up to 96558; without 49005 itself that is 47553, so 49005 is deficient (47553 is less than 49005). Euler's totient φ(49005) = 23760 numbers up to 49005 share no factor with it.
- 4
The digits of 49005 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49005 = 3^{4} \times 5 \times 11^{2} \]49005 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 96558 |
| Euler totient φ(n) | 23760 |
| Square | 2401490025 |
| Cube | 117685018675125 |
| Square root | 221.370730 (= 99√5) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9005 × |
49005 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and five |
| Binary (base 2) | 1011111101101101 |
| Octal (base 8) | 137555 |
| Hexadecimal (base 16) | BF6D |
| Base 3 | 2111020000 |
| As time | 49005 seconds = 13 h 36 min 45 s |
Is 49005 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 (49005 ÷ 3 = 16335) | 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 | Yes (49005 ÷ 5 = 9801) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49005 ÷ 9 = 5445) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49005 ÷ 11 = 4455) | 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 49005 a prime number?
No. 49005 = × 5 × , so it is divisible by 3.
What are the factors of 49005?
1, 3, 5, 9, 11, 15, 27, 33, 45, 55, 81, 99, 121, 135, 165, 297, 363, 405, 495, 605, 891, 1089, 1485, 1815, 3267, 4455, 5445, 9801, 16335, 49005.
What is 49005 in binary?
1011111101101101 (hexadecimal BF6D, octal 137555).
What is the square root of 49005?
About 221.3707, exactly 99√5.
Is 49005 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 49005?
It is a composite number with 30 divisors.