The number 49515
49515 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3301. Divisors (8): 1, 3, 5, 15, 3301, 9903, 16505, 49515.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49515 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49515 is composite. Its prime factorisation is
- 3
The divisors add up to 79248; without 49515 itself that is 29733, so 49515 is deficient (29733 is less than 49515). Euler's totient φ(49515) = 26400 numbers up to 49515 share no factor with it.
- 4
The digits of 49515 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49515 = 3 \times 5 \times 3301 \]
49515 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79248 |
| Euler totient φ(n) | 26400 |
| Square | 2451735225 |
| Cube | 121397669665875 |
| Square root | 222.519662 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.9515 × |
49515 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and fifteen |
| Binary (base 2) | 1100000101101011 |
| Octal (base 8) | 140553 |
| Hexadecimal (base 16) | C16B |
| Base 3 | 2111220220 |
| As time | 49515 seconds = 13 h 45 min 15 s |
Is 49515 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 (49515 ÷ 3 = 16505) | 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 (49515 ÷ 5 = 9903) | 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 4) | 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 6) | 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 4) | 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 49515 a prime number?
No. 49515 = 3 × 5 × 3301, so it is divisible by 3.
What are the factors of 49515?
1, 3, 5, 15, 3301, 9903, 16505, 49515.
What is 49515 in binary?
1100000101101011 (hexadecimal C16B, octal 140553).
What is the square root of 49515?
About 222.5197.
Is 49515 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49515?
It is a composite number with 8 divisors.