The number 48935
48935 is a composite number with 4 divisors. Its prime factorisation is 5 × 9787. Divisors (4): 1, 5, 9787, 48935.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48935: a semiprime: 5 × 9787, the product of two primes.
- 2
48935 is composite. Its prime factorisation is
- 3
The divisors add up to 58728; without 48935 itself that is 9793, so 48935 is deficient (9793 is less than 48935). Euler's totient φ(48935) = 39144 numbers up to 48935 share no factor with it.
- 4
The digits of 48935 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48935 = 5 \times 9787 \]
48935 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58728 |
| Euler totient φ(n) | 39144 |
| Square | 2394634225 |
| Cube | 117181425800375 |
| Square root | 221.212567 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8935 × |
48935 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and thirty-five |
| Binary (base 2) | 1011111100100111 |
| Octal (base 8) | 137447 |
| Hexadecimal (base 16) | BF27 |
| Base 3 | 2111010102 |
| As time | 48935 seconds = 13 h 35 min 35 s |
Is 48935 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 | Yes (48935 ÷ 5 = 9787) | 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 7) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 48935 a prime number?
No. 48935 = 5 × 9787, so it is divisible by 5.
What are the factors of 48935?
1, 5, 9787, 48935.
What is 48935 in binary?
1011111100100111 (hexadecimal BF27, octal 137447).
What is the square root of 48935?
About 221.2126.
Is 48935 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 48935?
48935 is a semiprime: 5 × 9787, the product of two primes.