The number 48579
48579 is a composite number with 4 divisors. Its prime factorisation is 3 × 16193. Divisors (4): 1, 3, 16193, 48579.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48579: a semiprime: 3 × 16193, the product of two primes.
- 2
48579 is composite. Its prime factorisation is
- 3
The divisors add up to 64776; without 48579 itself that is 16197, so 48579 is deficient (16197 is less than 48579). Euler's totient φ(48579) = 32384 numbers up to 48579 share no factor with it.
- 4
The digits of 48579 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48579 = 3 \times 16193 \]
48579 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64776 |
| Euler totient φ(n) | 32384 |
| Square | 2359919241 |
| Cube | 114642516808539 |
| Square root | 220.406443 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.8579 × |
48579 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and seventy-nine |
| Binary (base 2) | 1011110111000011 |
| Octal (base 8) | 136703 |
| Hexadecimal (base 16) | BDC3 |
| Base 3 | 2110122020 |
| As time | 48579 seconds = 13 h 29 min 39 s |
Is 48579 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 (48579 ÷ 3 = 16193) | 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 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 3) | 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 3) | 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 48579 a prime number?
No. 48579 = 3 × 16193, so it is divisible by 3.
What are the factors of 48579?
1, 3, 16193, 48579.
What is 48579 in binary?
1011110111000011 (hexadecimal BDC3, octal 136703).
What is the square root of 48579?
About 220.4064.
Is 48579 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 48579?
48579 is a semiprime: 3 × 16193, the product of two primes.