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