The number 49135
49135 is a composite number with 8 divisors. Its prime factorisation is 5 × 31 × 317. Divisors (8): 1, 5, 31, 155, 317, 1585, 9827, 49135.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49135 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49135 is composite. Its prime factorisation is
- 3
The divisors add up to 61056; without 49135 itself that is 11921, so 49135 is deficient (11921 is less than 49135). Euler's totient φ(49135) = 37920 numbers up to 49135 share no factor with it.
- 4
The digits of 49135 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49135 = 5 \times 31 \times 317 \]
49135 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 61056 |
| Euler totient φ(n) | 37920 |
| Square | 2414248225 |
| Cube | 118624086535375 |
| Square root | 221.664160 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9135 × |
49135 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and thirty-five |
| Binary (base 2) | 1011111111101111 |
| Octal (base 8) | 137757 |
| Hexadecimal (base 16) | BFEF |
| Base 3 | 2111101211 |
| As time | 49135 seconds = 13 h 38 min 55 s |
Is 49135 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 (49135 ÷ 5 = 9827) | 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 2) | 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 7) | 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 9) | 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 49135 a prime number?
No. 49135 = 5 × 31 × 317, so it is divisible by 5.
What are the factors of 49135?
1, 5, 31, 155, 317, 1585, 9827, 49135.
What is 49135 in binary?
1011111111101111 (hexadecimal BFEF, octal 137757).
What is the square root of 49135?
About 221.6642.
Is 49135 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49135?
It is a composite number with 8 divisors.