The number 49215
49215 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 17 × 193. Divisors (16): 1, 3, 5, 15, 17, 51, 85, 193, 255, 579, 965, 2895, 3281, 9843, 16405, 49215.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49215 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49215 is composite. Its prime factorisation is
- 3
The divisors add up to 83808; without 49215 itself that is 34593, so 49215 is deficient (34593 is less than 49215). Euler's totient φ(49215) = 24576 numbers up to 49215 share no factor with it.
- 4
The digits of 49215 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 220 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49215 = 3 \times 5 \times 17 \times 193 \]
49215 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 83808 |
| Euler totient φ(n) | 24576 |
| Square | 2422116225 |
| Cube | 119204450013375 |
| Square root | 221.844540 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 220 |
| Scientific notation | 4.9215 × |
49215 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and fifteen |
| Binary (base 2) | 1100000000111111 |
| Octal (base 8) | 140077 |
| Hexadecimal (base 16) | C03F |
| Base 3 | 2111111210 |
| As time | 49215 seconds = 13 h 40 min 15 s |
Is 49215 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 (49215 ÷ 3 = 16405) | 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 (49215 ÷ 5 = 9843) | 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 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 7) | 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 1) | 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 49215 a prime number?
No. 49215 = 3 × 5 × 17 × 193, so it is divisible by 3.
What are the factors of 49215?
1, 3, 5, 15, 17, 51, 85, 193, 255, 579, 965, 2895, 3281, 9843, 16405, 49215.
What is 49215 in binary?
1100000000111111 (hexadecimal C03F, octal 140077).
What is the square root of 49215?
About 221.8445.
Is 49215 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49215?
It is a composite number with 16 divisors.