The number 49678
49678 is a composite number with 8 divisors. Its prime factorisation is 2 × 59 × 421. Divisors (8): 1, 2, 59, 118, 421, 842, 24839, 49678.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49678 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49678 is composite. Its prime factorisation is
- 3
The divisors add up to 75960; without 49678 itself that is 26282, so 49678 is deficient (26282 is less than 49678). Euler's totient φ(49678) = 24360 numbers up to 49678 share no factor with it.
- 4
The digits of 49678 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49678 = 2 \times 59 \times 421 \]
49678 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75960 |
| Euler totient φ(n) | 24360 |
| Square | 2467903684 |
| Cube | 122600519213752 |
| Square root | 222.885621 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 140 |
| Scientific notation | 4.9678 × |
49678 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and seventy-eight |
| Binary (base 2) | 1100001000001110 |
| Octal (base 8) | 141016 |
| Hexadecimal (base 16) | C20E |
| Base 3 | 2112010221 |
| As time | 49678 seconds = 13 h 47 min 58 s |
Is 49678 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49678 ÷ 2 = 24839) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49678 a prime number?
No. 49678 = 2 × 59 × 421, so it is divisible by 2.
What are the factors of 49678?
1, 2, 59, 118, 421, 842, 24839, 49678.
What is 49678 in binary?
1100001000001110 (hexadecimal C20E, octal 141016).
What is the square root of 49678?
About 222.8856.
Is 49678 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 49678?
It is a composite number with 8 divisors.