The number 48759
48759 is a composite number with 4 divisors. Its prime factorisation is 3 × 16253. Divisors (4): 1, 3, 16253, 48759.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48759: a semiprime: 3 × 16253, the product of two primes.
- 2
48759 is composite. Its prime factorisation is
- 3
The divisors add up to 65016; without 48759 itself that is 16257, so 48759 is deficient (16257 is less than 48759). Euler's totient φ(48759) = 32504 numbers up to 48759 share no factor with it.
- 4
The digits of 48759 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48759 = 3 \times 16253 \]
48759 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65016 |
| Euler totient φ(n) | 32504 |
| Square | 2377440081 |
| Cube | 115921600909479 |
| Square root | 220.814402 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8759 × |
48759 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand seven hundred and fifty-nine |
| Binary (base 2) | 1011111001110111 |
| Octal (base 8) | 137167 |
| Hexadecimal (base 16) | BE77 |
| Base 3 | 2110212220 |
| As time | 48759 seconds = 13 h 32 min 39 s |
Is 48759 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 | Yes (48759 ÷ 3 = 16253) | 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 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48759 a prime number?
No. 48759 = 3 × 16253, so it is divisible by 3.
What are the factors of 48759?
1, 3, 16253, 48759.
What is 48759 in binary?
1011111001110111 (hexadecimal BE77, octal 137167).
What is the square root of 48759?
About 220.8144.
Is 48759 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 48759?
48759 is a semiprime: 3 × 16253, the product of two primes.