The number 49675
49675 is a composite number with 6 divisors. Its prime factorisation is Ć 1987. Divisors (6): 1, 5, 25, 1987, 9935, 49675.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49675 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49675 is composite. Its prime factorisation is
- 3
The divisors add up to 61628; without 49675 itself that is 11953, so 49675 is deficient (11953 is less than 49675). Euler's totient Ļ(49675) = 39720 numbers up to 49675 share no factor with it.
- 4
The digits of 49675 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49675 = 5^{2} \times 1987 \]49675 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 61628 |
| Euler totient Ļ(n) | 39720 |
| Square | 2467605625 |
| Cube | 122578309421875 |
| Square root | 222.878891 (= 5ā1987) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9675 Ć |
49675 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and seventy-five |
| Binary (base 2) | 1100001000001011 |
| Octal (base 8) | 141013 |
| Hexadecimal (base 16) | C20B |
| Base 3 | 2112010211 |
| As time | 49675 seconds = 13 h 47 min 55 s |
Is 49675 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 | Yes (49675 Ć· 5 = 9935) | 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 | No (remainder 3) | 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 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 49675 a prime number?
No. 49675 = Ć 1987, so it is divisible by 5.
What are the factors of 49675?
1, 5, 25, 1987, 9935, 49675.
What is 49675 in binary?
1100001000001011 (hexadecimal C20B, octal 141013).
What is the square root of 49675?
About 222.8789, exactly 5ā1987.
Is 49675 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49675?
It is a composite number with 6 divisors.