The number 49509
49509 is a composite number with 6 divisors. Its prime factorisation is × 5501. Divisors (6): 1, 3, 9, 5501, 16503, 49509.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49509: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49509 is composite. Its prime factorisation is
- 3
The divisors add up to 71526; without 49509 itself that is 22017, so 49509 is deficient (22017 is less than 49509). Euler's totient φ(49509) = 33000 numbers up to 49509 share no factor with it.
- 4
The digits of 49509 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49509 = 3^{2} \times 5501 \]49509 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 71526 |
| Euler totient φ(n) | 33000 |
| Square | 2451141081 |
| Cube | 121353543779229 |
| Square root | 222.506180 (= 3√5501) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9509 × |
49509 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and nine |
| Binary (base 2) | 1100000101100101 |
| Octal (base 8) | 140545 |
| Hexadecimal (base 16) | C165 |
| Base 3 | 2111220200 |
| As time | 49509 seconds = 13 h 45 min 9 s |
Is 49509 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 (49509 ÷ 3 = 16503) | 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 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 (49509 ÷ 9 = 5501) | 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 9) | 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 49509 a prime number?
No. 49509 = × 5501, so it is divisible by 3.
What are the factors of 49509?
1, 3, 9, 5501, 16503, 49509.
What is 49509 in binary?
1100000101100101 (hexadecimal C165, octal 140545).
What is the square root of 49509?
About 222.5062, exactly 3√5501.
Is 49509 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49509?
49509 is a happy number: repeatedly adding the squares of its digits reaches 1.