The number 49567
49567 is a composite number with 8 divisors. Its prime factorisation is 7 × 73 × 97. Divisors (8): 1, 7, 73, 97, 511, 679, 7081, 49567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49567 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49567 is composite. Its prime factorisation is
- 3
The divisors add up to 58016; without 49567 itself that is 8449, so 49567 is deficient (8449 is less than 49567). Euler's totient φ(49567) = 41472 numbers up to 49567 share no factor with it.
- 4
The digits of 49567 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49567 = 7 \times 73 \times 97 \]
49567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58016 |
| Euler totient φ(n) | 41472 |
| Square | 2456887489 |
| Cube | 121780542167263 |
| Square root | 222.636475 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.9567 × |
49567 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and sixty-seven |
| Binary (base 2) | 1100000110011111 |
| Octal (base 8) | 140637 |
| Hexadecimal (base 16) | C19F |
| Base 3 | 2111222211 |
| As time | 49567 seconds = 13 h 46 min 7 s |
Is 49567 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49567 ÷ 7 = 7081) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49567 a prime number?
No. 49567 = 7 × 73 × 97, so it is divisible by 7.
What are the factors of 49567?
1, 7, 73, 97, 511, 679, 7081, 49567.
What is 49567 in binary?
1100000110011111 (hexadecimal C19F, octal 140637).
What is the square root of 49567?
About 222.6365.
Is 49567 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49567?
It is a composite number with 8 divisors.