The number 49147
49147 is a composite number with 12 divisors. Its prime factorisation is × 17 × 59. Divisors (12): 1, 7, 17, 49, 59, 119, 413, 833, 1003, 2891, 7021, 49147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49147 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49147 is composite. Its prime factorisation is
- 3
The divisors add up to 61560; without 49147 itself that is 12413, so 49147 is deficient (12413 is less than 49147). Euler's totient φ(49147) = 38976 numbers up to 49147 share no factor with it.
- 4
The digits of 49147 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49147 = 7^{2} \times 17 \times 59 \]49147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 61560 |
| Euler totient φ(n) | 38976 |
| Square | 2415427609 |
| Cube | 118711020699523 |
| Square root | 221.691227 (= 7√1003) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9147 × |
49147 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and forty-seven |
| Binary (base 2) | 1011111111111011 |
| Octal (base 8) | 137773 |
| Hexadecimal (base 16) | BFFB |
| Base 3 | 2111102021 |
| As time | 49147 seconds = 13 h 39 min 7 s |
Is 49147 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 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49147 ÷ 7 = 7021) | 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 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49147 a prime number?
No. 49147 = × 17 × 59, so it is divisible by 7.
What are the factors of 49147?
1, 7, 17, 49, 59, 119, 413, 833, 1003, 2891, 7021, 49147.
What is 49147 in binary?
1011111111111011 (hexadecimal BFFB, octal 137773).
What is the square root of 49147?
About 221.6912, exactly 7√1003.
Is 49147 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49147?
It is a composite number with 12 divisors.