The number 49065
49065 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3271. Divisors (8): 1, 3, 5, 15, 3271, 9813, 16355, 49065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49065 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49065 is composite. Its prime factorisation is
- 3
The divisors add up to 78528; without 49065 itself that is 29463, so 49065 is deficient (29463 is less than 49065). Euler's totient φ(49065) = 26160 numbers up to 49065 share no factor with it.
- 4
The digits of 49065 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49065 = 3 \times 5 \times 3271 \]
49065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78528 |
| Euler totient φ(n) | 26160 |
| Square | 2407374225 |
| Cube | 118117816349625 |
| Square root | 221.506208 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.9065 × |
49065 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and sixty-five |
| Binary (base 2) | 1011111110101001 |
| Octal (base 8) | 137651 |
| Hexadecimal (base 16) | BFA9 |
| Base 3 | 2111022020 |
| As time | 49065 seconds = 13 h 37 min 45 s |
Is 49065 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 (49065 ÷ 3 = 16355) | 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 (49065 ÷ 5 = 9813) | 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 1) | 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 5) | 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 49065 a prime number?
No. 49065 = 3 × 5 × 3271, so it is divisible by 3.
What are the factors of 49065?
1, 3, 5, 15, 3271, 9813, 16355, 49065.
What is 49065 in binary?
1011111110101001 (hexadecimal BFA9, octal 137651).
What is the square root of 49065?
About 221.5062.
Is 49065 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49065?
It is a composite number with 8 divisors.