The number 47695
47695 is a composite number with 4 divisors. Its prime factorisation is 5 × 9539. Divisors (4): 1, 5, 9539, 47695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47695: a semiprime: 5 × 9539, the product of two primes.
- 2
47695 is composite. Its prime factorisation is
- 3
The divisors add up to 57240; without 47695 itself that is 9545, so 47695 is deficient (9545 is less than 47695). Euler's totient φ(47695) = 38152 numbers up to 47695 share no factor with it.
- 4
The digits of 47695 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47695 = 5 \times 9539 \]
47695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57240 |
| Euler totient φ(n) | 38152 |
| Square | 2274813025 |
| Cube | 108497207227375 |
| Square root | 218.391850 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7695 × |
47695 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand six hundred and ninety-five |
| Binary (base 2) | 1011101001001111 |
| Octal (base 8) | 135117 |
| Hexadecimal (base 16) | BA4F |
| Base 3 | 2102102111 |
| As time | 47695 seconds = 13 h 14 min 55 s |
Is 47695 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 (47695 ÷ 5 = 9539) | 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 4) | 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 10) | 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 47695 a prime number?
No. 47695 = 5 × 9539, so it is divisible by 5.
What are the factors of 47695?
1, 5, 9539, 47695.
What is 47695 in binary?
1011101001001111 (hexadecimal BA4F, octal 135117).
What is the square root of 47695?
About 218.3918.
Is 47695 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 47695?
47695 is a semiprime: 5 × 9539, the product of two primes.