The number 49345
49345 is a composite number with 8 divisors. Its prime factorisation is 5 × 71 × 139. Divisors (8): 1, 5, 71, 139, 355, 695, 9869, 49345.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49345 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49345 is composite. Its prime factorisation is
- 3
The divisors add up to 60480; without 49345 itself that is 11135, so 49345 is deficient (11135 is less than 49345). Euler's totient φ(49345) = 38640 numbers up to 49345 share no factor with it.
- 4
The digits of 49345 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49345 = 5 \times 71 \times 139 \]
49345 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 60480 |
| Euler totient φ(n) | 38640 |
| Square | 2434929025 |
| Cube | 120151572738625 |
| Square root | 222.137345 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9345 × |
49345 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and forty-five |
| Binary (base 2) | 1100000011000001 |
| Octal (base 8) | 140301 |
| Hexadecimal (base 16) | C0C1 |
| Base 3 | 2111200121 |
| As time | 49345 seconds = 13 h 42 min 25 s |
Is 49345 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 1) | 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 (49345 ÷ 5 = 9869) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 7) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49345 a prime number?
No. 49345 = 5 × 71 × 139, so it is divisible by 5.
What are the factors of 49345?
1, 5, 71, 139, 355, 695, 9869, 49345.
What is 49345 in binary?
1100000011000001 (hexadecimal C0C1, octal 140301).
What is the square root of 49345?
About 222.1373.
Is 49345 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49345?
It is a composite number with 8 divisors.