The number 48915
48915 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1087. Divisors (12): 1, 3, 5, 9, 15, 45, 1087, 3261, 5435, 9783, 16305, 48915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48915 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48915 is composite. Its prime factorisation is
- 3
The divisors add up to 84864; without 48915 itself that is 35949, so 48915 is deficient (35949 is less than 48915). Euler's totient φ(48915) = 26064 numbers up to 48915 share no factor with it.
- 4
The digits of 48915 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48915 = 3^{2} \times 5 \times 1087 \]48915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 84864 |
| Euler totient φ(n) | 26064 |
| Square | 2392677225 |
| Cube | 117037806460875 |
| Square root | 221.167357 (= 3√5435) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 171 |
| Scientific notation | 4.8915 × |
48915 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and fifteen |
| Binary (base 2) | 1011111100010011 |
| Octal (base 8) | 137423 |
| Hexadecimal (base 16) | BF13 |
| Base 3 | 2111002200 |
| As time | 48915 seconds = 13 h 35 min 15 s |
Is 48915 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 (48915 ÷ 3 = 16305) | 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 | Yes (48915 ÷ 5 = 9783) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48915 ÷ 9 = 5435) | 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 | No (remainder 9) | 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 48915 a prime number?
No. 48915 = × 5 × 1087, so it is divisible by 3.
What are the factors of 48915?
1, 3, 5, 9, 15, 45, 1087, 3261, 5435, 9783, 16305, 48915.
What is 48915 in binary?
1011111100010011 (hexadecimal BF13, octal 137423).
What is the square root of 48915?
About 221.1674, exactly 3√5435.
Is 48915 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48915?
It is a composite number with 12 divisors.