The number 49565
49565 is a composite number with 8 divisors. Its prime factorisation is 5 × 23 × 431. Divisors (8): 1, 5, 23, 115, 431, 2155, 9913, 49565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49565 is composite. Its prime factorisation is
- 3
The divisors add up to 62208; without 49565 itself that is 12643, so 49565 is deficient (12643 is less than 49565). Euler's totient φ(49565) = 37840 numbers up to 49565 share no factor with it.
- 4
The digits of 49565 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49565 = 5 \times 23 \times 431 \]
49565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62208 |
| Euler totient φ(n) | 37840 |
| Square | 2456689225 |
| Cube | 121765801437125 |
| Square root | 222.631983 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9565 × |
49565 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and sixty-five |
| Binary (base 2) | 1100000110011101 |
| Octal (base 8) | 140635 |
| Hexadecimal (base 16) | C19D |
| Base 3 | 2111222202 |
| As time | 49565 seconds = 13 h 46 min 5 s |
Is 49565 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 2) | 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 (49565 ÷ 5 = 9913) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 | No (remainder 2) | 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 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49565 a prime number?
No. 49565 = 5 × 23 × 431, so it is divisible by 5.
What are the factors of 49565?
1, 5, 23, 115, 431, 2155, 9913, 49565.
What is 49565 in binary?
1100000110011101 (hexadecimal C19D, octal 140635).
What is the square root of 49565?
About 222.6320.
Is 49565 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49565?
It is a composite number with 8 divisors.