The number 48561
48561 is a composite number with 4 divisors. Its prime factorisation is 3 × 16187. Divisors (4): 1, 3, 16187, 48561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48561: a semiprime: 3 × 16187, the product of two primes.
- 2
48561 is composite. Its prime factorisation is
- 3
The divisors add up to 64752; without 48561 itself that is 16191, so 48561 is deficient (16191 is less than 48561). Euler's totient φ(48561) = 32372 numbers up to 48561 share no factor with it.
- 4
The digits of 48561 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48561 = 3 \times 16187 \]
48561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64752 |
| Euler totient φ(n) | 32372 |
| Square | 2358170721 |
| Cube | 114515128382481 |
| Square root | 220.365605 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8561 × |
48561 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and sixty-one |
| Binary (base 2) | 1011110110110001 |
| Octal (base 8) | 136661 |
| Hexadecimal (base 16) | BDB1 |
| Base 3 | 2110121120 |
| As time | 48561 seconds = 13 h 29 min 21 s |
Is 48561 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 (48561 ÷ 3 = 16187) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 1) | 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 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48561 a prime number?
No. 48561 = 3 × 16187, so it is divisible by 3.
What are the factors of 48561?
1, 3, 16187, 48561.
What is 48561 in binary?
1011110110110001 (hexadecimal BDB1, octal 136661).
What is the square root of 48561?
About 220.3656.
Is 48561 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 48561?
48561 is a semiprime: 3 × 16187, the product of two primes.