The number 49707
49707 is a composite number with 16 divisors. Its prime factorisation is × 7 × 263. Divisors (16): 1, 3, 7, 9, 21, 27, 63, 189, 263, 789, 1841, 2367, 5523, 7101, 16569, 49707.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49707: a Harshad number: divisible by its digit sum 27.
- 2
49707 is composite. Its prime factorisation is
- 3
The divisors add up to 84480; without 49707 itself that is 34773, so 49707 is deficient (34773 is less than 49707). Euler's totient φ(49707) = 28296 numbers up to 49707 share no factor with it.
- 4
The digits of 49707 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49707 = 3^{3} \times 7 \times 263 \]49707 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 84480 |
| Euler totient φ(n) | 28296 |
| Square | 2470785849 |
| Cube | 122815352196243 |
| Square root | 222.950667 (= 3√5523) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9707 × |
49707 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and seven |
| Binary (base 2) | 1100001000101011 |
| Octal (base 8) | 141053 |
| Hexadecimal (base 16) | C22B |
| Base 3 | 2112012000 |
| As time | 49707 seconds = 13 h 48 min 27 s |
Is 49707 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 (49707 ÷ 3 = 16569) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49707 ÷ 7 = 7101) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49707 ÷ 9 = 5523) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49707 a prime number?
No. 49707 = × 7 × 263, so it is divisible by 3.
What are the factors of 49707?
1, 3, 7, 9, 21, 27, 63, 189, 263, 789, 1841, 2367, 5523, 7101, 16569, 49707.
What is 49707 in binary?
1100001000101011 (hexadecimal C22B, octal 141053).
What is the square root of 49707?
About 222.9507, exactly 3√5523.
Is 49707 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49707?
49707 is a Harshad number: divisible by its digit sum 27.