The number 49259
49259 is a composite number with 8 divisors. Its prime factorisation is 7 × 31 × 227. Divisors (8): 1, 7, 31, 217, 227, 1589, 7037, 49259.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49259 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49259 is composite. Its prime factorisation is
- 3
The divisors add up to 58368; without 49259 itself that is 9109, so 49259 is deficient (9109 is less than 49259). Euler's totient φ(49259) = 40680 numbers up to 49259 share no factor with it.
- 4
The digits of 49259 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49259 = 7 \times 31 \times 227 \]
49259 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58368 |
| Euler totient φ(n) | 40680 |
| Square | 2426449081 |
| Cube | 119524455280979 |
| Square root | 221.943687 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.9259 × |
49259 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and fifty-nine |
| Binary (base 2) | 1100000001101011 |
| Octal (base 8) | 140153 |
| Hexadecimal (base 16) | C06B |
| Base 3 | 2111120102 |
| As time | 49259 seconds = 13 h 40 min 59 s |
Is 49259 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 | Yes (49259 ÷ 7 = 7037) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49259 a prime number?
No. 49259 = 7 × 31 × 227, so it is divisible by 7.
What are the factors of 49259?
1, 7, 31, 217, 227, 1589, 7037, 49259.
What is 49259 in binary?
1100000001101011 (hexadecimal C06B, octal 140153).
What is the square root of 49259?
About 221.9437.
Is 49259 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49259?
It is a composite number with 8 divisors.