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