The number 48315
48315 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3221. Divisors (8): 1, 3, 5, 15, 3221, 9663, 16105, 48315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48315 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48315 is composite. Its prime factorisation is
- 3
The divisors add up to 77328; without 48315 itself that is 29013, so 48315 is deficient (29013 is less than 48315). Euler's totient φ(48315) = 25760 numbers up to 48315 share no factor with it.
- 4
The digits of 48315 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 207 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48315 = 3 \times 5 \times 3221 \]
48315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77328 |
| Euler totient φ(n) | 25760 |
| Square | 2334339225 |
| Cube | 112783599655875 |
| Square root | 219.806733 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 207 |
| Scientific notation | 4.8315 × |
48315 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and fifteen |
| Binary (base 2) | 1011110010111011 |
| Octal (base 8) | 136273 |
| Hexadecimal (base 16) | BCBB |
| Base 3 | 2110021110 |
| As time | 48315 seconds = 13 h 25 min 15 s |
Is 48315 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 (48315 ÷ 3 = 16105) | 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 (48315 ÷ 5 = 9663) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 3) | 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 48315 a prime number?
No. 48315 = 3 × 5 × 3221, so it is divisible by 3.
What are the factors of 48315?
1, 3, 5, 15, 3221, 9663, 16105, 48315.
What is 48315 in binary?
1011110010111011 (hexadecimal BCBB, octal 136273).
What is the square root of 48315?
About 219.8067.
Is 48315 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48315?
It is a composite number with 8 divisors.