The number 49257
49257 is a composite number with 12 divisors. Its prime factorisation is × 13 × 421. Divisors (12): 1, 3, 9, 13, 39, 117, 421, 1263, 3789, 5473, 16419, 49257.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49257 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49257 is composite. Its prime factorisation is
- 3
The divisors add up to 76804; without 49257 itself that is 27547, so 49257 is deficient (27547 is less than 49257). Euler's totient φ(49257) = 30240 numbers up to 49257 share no factor with it.
- 4
The digits of 49257 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49257 = 3^{2} \times 13 \times 421 \]49257 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 76804 |
| Euler totient φ(n) | 30240 |
| Square | 2426252049 |
| Cube | 119509897177593 |
| Square root | 221.939181 (= 3√5473) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9257 × |
49257 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and fifty-seven |
| Binary (base 2) | 1100000001101001 |
| Octal (base 8) | 140151 |
| Hexadecimal (base 16) | C069 |
| Base 3 | 2111120100 |
| As time | 49257 seconds = 13 h 40 min 57 s |
Is 49257 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 (49257 ÷ 3 = 16419) | 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 | No (remainder 2) | 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 5) | 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 | Yes (49257 ÷ 9 = 5473) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49257 a prime number?
No. 49257 = × 13 × 421, so it is divisible by 3.
What are the factors of 49257?
1, 3, 9, 13, 39, 117, 421, 1263, 3789, 5473, 16419, 49257.
What is 49257 in binary?
1100000001101001 (hexadecimal C069, octal 140151).
What is the square root of 49257?
About 221.9392, exactly 3√5473.
Is 49257 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49257?
It is a composite number with 12 divisors.