The number 49485
49485 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3299. Divisors (8): 1, 3, 5, 15, 3299, 9897, 16495, 49485.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49485 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49485 is composite. Its prime factorisation is
- 3
The divisors add up to 79200; without 49485 itself that is 29715, so 49485 is deficient (29715 is less than 49485). Euler's totient φ(49485) = 26384 numbers up to 49485 share no factor with it.
- 4
The digits of 49485 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49485 = 3 \times 5 \times 3299 \]
49485 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79200 |
| Euler totient φ(n) | 26384 |
| Square | 2448765225 |
| Cube | 121177147159125 |
| Square root | 222.452242 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9485 × |
49485 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and eighty-five |
| Binary (base 2) | 1100000101001101 |
| Octal (base 8) | 140515 |
| Hexadecimal (base 16) | C14D |
| Base 3 | 2111212210 |
| As time | 49485 seconds = 13 h 44 min 45 s |
Is 49485 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 (49485 ÷ 3 = 16495) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49485 ÷ 5 = 9897) | 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 2) | 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 5) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49485 a prime number?
No. 49485 = 3 × 5 × 3299, so it is divisible by 3.
What are the factors of 49485?
1, 3, 5, 15, 3299, 9897, 16495, 49485.
What is 49485 in binary?
1100000101001101 (hexadecimal C14D, octal 140515).
What is the square root of 49485?
About 222.4522.
Is 49485 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49485?
It is a composite number with 8 divisors.