The number 49143
49143 is a composite number with 4 divisors. Its prime factorisation is 3 × 16381. Divisors (4): 1, 3, 16381, 49143.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49143: a semiprime: 3 × 16381, the product of two primes.
- 2
49143 is composite. Its prime factorisation is
- 3
The divisors add up to 65528; without 49143 itself that is 16385, so 49143 is deficient (16385 is less than 49143). Euler's totient φ(49143) = 32760 numbers up to 49143 share no factor with it.
- 4
The digits of 49143 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
\[ 49143 = 3 \times 16381 \]
49143 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65528 |
| Euler totient φ(n) | 32760 |
| Square | 2415034449 |
| Cube | 118682037927207 |
| Square root | 221.682205 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9143 × |
49143 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and forty-three |
| Binary (base 2) | 1011111111110111 |
| Octal (base 8) | 137767 |
| Hexadecimal (base 16) | BFF7 |
| Base 3 | 2111102010 |
| As time | 49143 seconds = 13 h 39 min 3 s |
Is 49143 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 (49143 ÷ 3 = 16381) | 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 3) | 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 3) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 49143 a prime number?
No. 49143 = 3 × 16381, so it is divisible by 3.
What are the factors of 49143?
1, 3, 16381, 49143.
What is 49143 in binary?
1011111111110111 (hexadecimal BFF7, octal 137767).
What is the square root of 49143?
About 221.6822.
Is 49143 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49143?
49143 is a semiprime: 3 × 16381, the product of two primes.