The number 49265
49265 is a composite number with 8 divisors. Its prime factorisation is 5 × 59 × 167. Divisors (8): 1, 5, 59, 167, 295, 835, 9853, 49265.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49265 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49265 is composite. Its prime factorisation is
- 3
The divisors add up to 60480; without 49265 itself that is 11215, so 49265 is deficient (11215 is less than 49265). Euler's totient φ(49265) = 38512 numbers up to 49265 share no factor with it.
- 4
The digits of 49265 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49265 = 5 \times 59 \times 167 \]
49265 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 60480 |
| Euler totient φ(n) | 38512 |
| Square | 2427040225 |
| Cube | 119568136684625 |
| Square root | 221.957203 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9265 × |
49265 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and sixty-five |
| Binary (base 2) | 1100000001110001 |
| Octal (base 8) | 140161 |
| Hexadecimal (base 16) | C071 |
| Base 3 | 2111120122 |
| As time | 49265 seconds = 13 h 41 min 5 s |
Is 49265 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 | No (remainder 2) | 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 (49265 ÷ 5 = 9853) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 8) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49265 a prime number?
No. 49265 = 5 × 59 × 167, so it is divisible by 5.
What are the factors of 49265?
1, 5, 59, 167, 295, 835, 9853, 49265.
What is 49265 in binary?
1100000001110001 (hexadecimal C071, octal 140161).
What is the square root of 49265?
About 221.9572.
Is 49265 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49265?
It is a composite number with 8 divisors.