The number 48581
48581 is a composite number with 8 divisors. Its prime factorisation is 13 × 37 × 101. Divisors (8): 1, 13, 37, 101, 481, 1313, 3737, 48581.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48581 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48581 is composite. Its prime factorisation is
- 3
The divisors add up to 54264; without 48581 itself that is 5683, so 48581 is deficient (5683 is less than 48581). Euler's totient φ(48581) = 43200 numbers up to 48581 share no factor with it.
- 4
The digits of 48581 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48581 = 13 \times 37 \times 101 \]
48581 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 54264 |
| Euler totient φ(n) | 43200 |
| Square | 2360113561 |
| Cube | 114656676906941 |
| Square root | 220.410980 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8581 × |
48581 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and eighty-one |
| Binary (base 2) | 1011110111000101 |
| Octal (base 8) | 136705 |
| Hexadecimal (base 16) | BDC5 |
| Base 3 | 2110122022 |
| As time | 48581 seconds = 13 h 29 min 41 s |
Is 48581 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48581 a prime number?
No. 48581 = 13 × 37 × 101, so it is divisible by 13.
What are the factors of 48581?
1, 13, 37, 101, 481, 1313, 3737, 48581.
What is 48581 in binary?
1011110111000101 (hexadecimal BDC5, octal 136705).
What is the square root of 48581?
About 220.4110.
Is 48581 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 48581?
It is a composite number with 8 divisors.