The number 49691
49691 is a composite number with 8 divisors. Its prime factorisation is 17 × 37 × 79. Divisors (8): 1, 17, 37, 79, 629, 1343, 2923, 49691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49691 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49691 is composite. Its prime factorisation is
- 3
The divisors add up to 54720; without 49691 itself that is 5029, so 49691 is deficient (5029 is less than 49691). Euler's totient φ(49691) = 44928 numbers up to 49691 share no factor with it.
- 4
The digits of 49691 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49691 = 17 \times 37 \times 79 \]
49691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 54720 |
| Euler totient φ(n) | 44928 |
| Square | 2469195481 |
| Cube | 122696792646371 |
| Square root | 222.914782 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9691 × |
49691 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and ninety-one |
| Binary (base 2) | 1100001000011011 |
| Octal (base 8) | 141033 |
| Hexadecimal (base 16) | C21B |
| Base 3 | 2112011102 |
| As time | 49691 seconds = 13 h 48 min 11 s |
Is 49691 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49691 a prime number?
No. 49691 = 17 × 37 × 79, so it is divisible by 17.
What are the factors of 49691?
1, 17, 37, 79, 629, 1343, 2923, 49691.
What is 49691 in binary?
1100001000011011 (hexadecimal C21B, octal 141033).
What is the square root of 49691?
About 222.9148.
Is 49691 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49691?
It is a composite number with 8 divisors.