The number 48591
48591 is a composite number with 6 divisors. Its prime factorisation is × 5399. Divisors (6): 1, 3, 9, 5399, 16197, 48591.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48591 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48591 is composite. Its prime factorisation is
- 3
The divisors add up to 70200; without 48591 itself that is 21609, so 48591 is deficient (21609 is less than 48591). Euler's totient φ(48591) = 32388 numbers up to 48591 share no factor with it.
- 4
The digits of 48591 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48591 = 3^{2} \times 5399 \]48591 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 70200 |
| Euler totient φ(n) | 32388 |
| Square | 2361085281 |
| Cube | 114727494889071 |
| Square root | 220.433663 (= 3√5399) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8591 × |
48591 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and ninety-one |
| Binary (base 2) | 1011110111001111 |
| Octal (base 8) | 136717 |
| Hexadecimal (base 16) | BDCF |
| Base 3 | 2110122200 |
| As time | 48591 seconds = 13 h 29 min 51 s |
Is 48591 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 (48591 ÷ 3 = 16197) | 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 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 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 | Yes (48591 ÷ 9 = 5399) | 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 4) | 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 48591 a prime number?
No. 48591 = × 5399, so it is divisible by 3.
What are the factors of 48591?
1, 3, 9, 5399, 16197, 48591.
What is 48591 in binary?
1011110111001111 (hexadecimal BDCF, octal 136717).
What is the square root of 48591?
About 220.4337, exactly 3√5399.
Is 48591 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48591?
It is a composite number with 6 divisors.