The number 49693
49693 is a composite number with 8 divisors. Its prime factorisation is 7 × 31 × 229. Divisors (8): 1, 7, 31, 217, 229, 1603, 7099, 49693.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49693: a Harshad number: divisible by its digit sum 31.
- 2
49693 is composite. Its prime factorisation is
- 3
The divisors add up to 58880; without 49693 itself that is 9187, so 49693 is deficient (9187 is less than 49693). Euler's totient φ(49693) = 41040 numbers up to 49693 share no factor with it.
- 4
The digits of 49693 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49693 = 7 \times 31 \times 229 \]
49693 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58880 |
| Euler totient φ(n) | 41040 |
| Square | 2469394249 |
| Cube | 122711608415557 |
| Square root | 222.919268 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9693 × |
49693 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and ninety-three |
| Binary (base 2) | 1100001000011101 |
| Octal (base 8) | 141035 |
| Hexadecimal (base 16) | C21D |
| Base 3 | 2112011111 |
| As time | 49693 seconds = 13 h 48 min 13 s |
Is 49693 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49693 ÷ 7 = 7099) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49693 a prime number?
No. 49693 = 7 × 31 × 229, so it is divisible by 7.
What are the factors of 49693?
1, 7, 31, 217, 229, 1603, 7099, 49693.
What is 49693 in binary?
1100001000011101 (hexadecimal C21D, octal 141035).
What is the square root of 49693?
About 222.9193.
Is 49693 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49693?
49693 is a Harshad number: divisible by its digit sum 31.