The number 49677
49677 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 571. Divisors (8): 1, 3, 29, 87, 571, 1713, 16559, 49677.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49677 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49677 is composite. Its prime factorisation is
- 3
The divisors add up to 68640; without 49677 itself that is 18963, so 49677 is deficient (18963 is less than 49677). Euler's totient φ(49677) = 31920 numbers up to 49677 share no factor with it.
- 4
The digits of 49677 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49677 = 3 \times 29 \times 571 \]
49677 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68640 |
| Euler totient φ(n) | 31920 |
| Square | 2467804329 |
| Cube | 122593115651733 |
| Square root | 222.883378 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9677 × |
49677 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and seventy-seven |
| Binary (base 2) | 1100001000001101 |
| Octal (base 8) | 141015 |
| Hexadecimal (base 16) | C20D |
| Base 3 | 2112010220 |
| As time | 49677 seconds = 13 h 47 min 57 s |
Is 49677 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 (49677 ÷ 3 = 16559) | 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 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 | 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 6) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49677 a prime number?
No. 49677 = 3 × 29 × 571, so it is divisible by 3.
What are the factors of 49677?
1, 3, 29, 87, 571, 1713, 16559, 49677.
What is 49677 in binary?
1100001000001101 (hexadecimal C20D, octal 141015).
What is the square root of 49677?
About 222.8834.
Is 49677 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 49677?
It is a composite number with 8 divisors.