The number 48590
48590 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 43 × 113. Divisors (16): 1, 2, 5, 10, 43, 86, 113, 215, 226, 430, 565, 1130, 4859, 9718, 24295, 48590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48590 is composite. Its prime factorisation is
- 3
The divisors add up to 90288; without 48590 itself that is 41698, so 48590 is deficient (41698 is less than 48590). Euler's totient φ(48590) = 18816 numbers up to 48590 share no factor with it.
- 4
The digits of 48590 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48590 = 2 \times 5 \times 43 \times 113 \]
48590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 90288 |
| Euler totient φ(n) | 18816 |
| Square | 2360988100 |
| Cube | 114720411779000 |
| Square root | 220.431395 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.859 × |
48590 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and ninety |
| Binary (base 2) | 1011110111001110 |
| Octal (base 8) | 136716 |
| Hexadecimal (base 16) | BDCE |
| Base 3 | 2110122122 |
| As time | 48590 seconds = 13 h 29 min 50 s |
Is 48590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48590 ÷ 2 = 24295) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48590 ÷ 5 = 9718) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (48590 ÷ 10 = 4859) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48590 a prime number?
No. 48590 = 2 × 5 × 43 × 113, so it is divisible by 2.
What are the factors of 48590?
1, 2, 5, 10, 43, 86, 113, 215, 226, 430, 565, 1130, 4859, 9718, 24295, 48590.
What is 48590 in binary?
1011110111001110 (hexadecimal BDCE, octal 136716).
What is the square root of 48590?
About 220.4314.
Is 48590 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 48590?
It is a composite number with 16 divisors.