The number 48515
48515 is a composite number with 8 divisors. Its prime factorisation is 5 × 31 × 313. Divisors (8): 1, 5, 31, 155, 313, 1565, 9703, 48515.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48515 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48515 is composite. Its prime factorisation is
- 3
The divisors add up to 60288; without 48515 itself that is 11773, so 48515 is deficient (11773 is less than 48515). Euler's totient φ(48515) = 37440 numbers up to 48515 share no factor with it.
- 4
The digits of 48515 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48515 = 5 \times 31 \times 313 \]
48515 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 60288 |
| Euler totient φ(n) | 37440 |
| Square | 2353705225 |
| Cube | 114190008990875 |
| Square root | 220.261209 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8515 × |
48515 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and fifteen |
| Binary (base 2) | 1011110110000011 |
| Octal (base 8) | 136603 |
| Hexadecimal (base 16) | BD83 |
| Base 3 | 2110112212 |
| As time | 48515 seconds = 13 h 28 min 35 s |
Is 48515 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48515 ÷ 5 = 9703) | 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 5) | 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 5) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48515 a prime number?
No. 48515 = 5 × 31 × 313, so it is divisible by 5.
What are the factors of 48515?
1, 5, 31, 155, 313, 1565, 9703, 48515.
What is 48515 in binary?
1011110110000011 (hexadecimal BD83, octal 136603).
What is the square root of 48515?
About 220.2612.
Is 48515 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48515?
It is a composite number with 8 divisors.