The number 48695
48695 is a composite number with 4 divisors. Its prime factorisation is 5 × 9739. Divisors (4): 1, 5, 9739, 48695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48695: a semiprime: 5 × 9739, the product of two primes.
- 2
48695 is composite. Its prime factorisation is
- 3
The divisors add up to 58440; without 48695 itself that is 9745, so 48695 is deficient (9745 is less than 48695). Euler's totient φ(48695) = 38952 numbers up to 48695 share no factor with it.
- 4
The digits of 48695 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48695 = 5 \times 9739 \]
48695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58440 |
| Euler totient φ(n) | 38952 |
| Square | 2371203025 |
| Cube | 115465731302375 |
| Square root | 220.669436 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8695 × |
48695 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand six hundred and ninety-five |
| Binary (base 2) | 1011111000110111 |
| Octal (base 8) | 137067 |
| Hexadecimal (base 16) | BE37 |
| Base 3 | 2110210112 |
| As time | 48695 seconds = 13 h 31 min 35 s |
Is 48695 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 (48695 ÷ 5 = 9739) | 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 3) | 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 5) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48695 a prime number?
No. 48695 = 5 × 9739, so it is divisible by 5.
What are the factors of 48695?
1, 5, 9739, 48695.
What is 48695 in binary?
1011111000110111 (hexadecimal BE37, octal 137067).
What is the square root of 48695?
About 220.6694.
Is 48695 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 48695?
48695 is a semiprime: 5 × 9739, the product of two primes.