The number 49071
49071 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1487. Divisors (8): 1, 3, 11, 33, 1487, 4461, 16357, 49071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49071 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49071 is composite. Its prime factorisation is
- 3
The divisors add up to 71424; without 49071 itself that is 22353, so 49071 is deficient (22353 is less than 49071). Euler's totient φ(49071) = 29720 numbers up to 49071 share no factor with it.
- 4
The digits of 49071 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49071 = 3 \times 11 \times 1487 \]
49071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71424 |
| Euler totient φ(n) | 29720 |
| Square | 2407963041 |
| Cube | 118161154384911 |
| Square root | 221.519751 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9071 × |
49071 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and seventy-one |
| Binary (base 2) | 1011111110101111 |
| Octal (base 8) | 137657 |
| Hexadecimal (base 16) | BFAF |
| Base 3 | 2111022110 |
| As time | 49071 seconds = 13 h 37 min 51 s |
Is 49071 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 (49071 ÷ 3 = 16357) | 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 1) | 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 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49071 ÷ 11 = 4461) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49071 a prime number?
No. 49071 = 3 × 11 × 1487, so it is divisible by 3.
What are the factors of 49071?
1, 3, 11, 33, 1487, 4461, 16357, 49071.
What is 49071 in binary?
1011111110101111 (hexadecimal BFAF, octal 137657).
What is the square root of 49071?
About 221.5198.
Is 49071 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49071?
It is a composite number with 8 divisors.