The number 49395
49395 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 37 × 89. Divisors (16): 1, 3, 5, 15, 37, 89, 111, 185, 267, 445, 555, 1335, 3293, 9879, 16465, 49395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49395 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49395 is composite. Its prime factorisation is
- 3
The divisors add up to 82080; without 49395 itself that is 32685, so 49395 is deficient (32685 is less than 49395). Euler's totient φ(49395) = 25344 numbers up to 49395 share no factor with it.
- 4
The digits of 49395 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49395 = 3 \times 5 \times 37 \times 89 \]
49395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 82080 |
| Euler totient φ(n) | 25344 |
| Square | 2439866025 |
| Cube | 120517182304875 |
| Square root | 222.249859 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.9395 × |
49395 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and ninety-five |
| Binary (base 2) | 1100000011110011 |
| Octal (base 8) | 140363 |
| Hexadecimal (base 16) | C0F3 |
| Base 3 | 2111202110 |
| As time | 49395 seconds = 13 h 43 min 15 s |
Is 49395 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 (49395 ÷ 3 = 16465) | 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 (49395 ÷ 5 = 9879) | 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 3) | 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 5) | 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 49395 a prime number?
No. 49395 = 3 × 5 × 37 × 89, so it is divisible by 3.
What are the factors of 49395?
1, 3, 5, 15, 37, 89, 111, 185, 267, 445, 555, 1335, 3293, 9879, 16465, 49395.
What is 49395 in binary?
1100000011110011 (hexadecimal C0F3, octal 140363).
What is the square root of 49395?
About 222.2499.
Is 49395 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49395?
It is a composite number with 16 divisors.