The number 48715
48715 is a composite number with 4 divisors. Its prime factorisation is 5 × 9743. Divisors (4): 1, 5, 9743, 48715.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48715: a semiprime: 5 × 9743, the product of two primes.
- 2
48715 is composite. Its prime factorisation is
- 3
The divisors add up to 58464; without 48715 itself that is 9749, so 48715 is deficient (9749 is less than 48715). Euler's totient φ(48715) = 38968 numbers up to 48715 share no factor with it.
- 4
The digits of 48715 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48715 = 5 \times 9743 \]
48715 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58464 |
| Euler totient φ(n) | 38968 |
| Square | 2373151225 |
| Cube | 115608061925875 |
| Square root | 220.714748 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8715 × |
48715 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand seven hundred and fifteen |
| Binary (base 2) | 1011111001001011 |
| Octal (base 8) | 137113 |
| Hexadecimal (base 16) | BE4B |
| Base 3 | 2110211021 |
| As time | 48715 seconds = 13 h 31 min 55 s |
Is 48715 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 (48715 ÷ 5 = 9743) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48715 a prime number?
No. 48715 = 5 × 9743, so it is divisible by 5.
What are the factors of 48715?
1, 5, 9743, 48715.
What is 48715 in binary?
1011111001001011 (hexadecimal BE4B, octal 137113).
What is the square root of 48715?
About 220.7147.
Is 48715 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48715?
48715 is a semiprime: 5 × 9743, the product of two primes.