The number 49435
49435 is a composite number with 4 divisors. Its prime factorisation is 5 × 9887. Divisors (4): 1, 5, 9887, 49435.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49435: a semiprime: 5 × 9887, the product of two primes.
- 2
49435 is composite. Its prime factorisation is
- 3
The divisors add up to 59328; without 49435 itself that is 9893, so 49435 is deficient (9893 is less than 49435). Euler's totient φ(49435) = 39544 numbers up to 49435 share no factor with it.
- 4
The digits of 49435 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 264 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49435 = 5 \times 9887 \]
49435 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59328 |
| Euler totient φ(n) | 39544 |
| Square | 2443819225 |
| Cube | 120810203387875 |
| Square root | 222.339830 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 264 |
| Scientific notation | 4.9435 × |
49435 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and thirty-five |
| Binary (base 2) | 1100000100011011 |
| Octal (base 8) | 140433 |
| Hexadecimal (base 16) | C11B |
| Base 3 | 2111210221 |
| As time | 49435 seconds = 13 h 43 min 55 s |
Is 49435 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 (49435 ÷ 5 = 9887) | 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 1) | 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 7) | 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 1) | 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 49435 a prime number?
No. 49435 = 5 × 9887, so it is divisible by 5.
What are the factors of 49435?
1, 5, 9887, 49435.
What is 49435 in binary?
1100000100011011 (hexadecimal C11B, octal 140433).
What is the square root of 49435?
About 222.3398.
Is 49435 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49435?
49435 is a semiprime: 5 × 9887, the product of two primes.