The number 48565
48565 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 883. Divisors (8): 1, 5, 11, 55, 883, 4415, 9713, 48565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48565 is composite. Its prime factorisation is
- 3
The divisors add up to 63648; without 48565 itself that is 15083, so 48565 is deficient (15083 is less than 48565). Euler's totient φ(48565) = 35280 numbers up to 48565 share no factor with it.
- 4
The digits of 48565 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48565 = 5 \times 11 \times 883 \]
48565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 63648 |
| Euler totient φ(n) | 35280 |
| Square | 2358559225 |
| Cube | 114543428762125 |
| Square root | 220.374681 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8565 × |
48565 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and sixty-five |
| Binary (base 2) | 1011110110110101 |
| Octal (base 8) | 136665 |
| Hexadecimal (base 16) | BDB5 |
| Base 3 | 2110121201 |
| As time | 48565 seconds = 13 h 29 min 25 s |
Is 48565 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 1) | 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 | Yes (48565 ÷ 5 = 9713) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (48565 ÷ 11 = 4415) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48565 a prime number?
No. 48565 = 5 × 11 × 883, so it is divisible by 5.
What are the factors of 48565?
1, 5, 11, 55, 883, 4415, 9713, 48565.
What is 48565 in binary?
1011110110110101 (hexadecimal BDB5, octal 136665).
What is the square root of 48565?
About 220.3747.
Is 48565 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 48565?
It is a composite number with 8 divisors.