The number 16143
16143 is a composite number with 4 divisors. Its prime factorisation is 3 × 5381. Divisors (4): 1, 3, 5381, 16143.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16143: a semiprime: 3 × 5381, the product of two primes.
- 2
16143 is composite. Its prime factorisation is
- 3
The divisors add up to 21528; without 16143 itself that is 5385, so 16143 is deficient (5385 is less than 16143). Euler's totient φ(16143) = 10760 numbers up to 16143 share no factor with it.
- 4
The digits of 16143 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16143 = 3 \times 5381 \]
16143 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21528 |
| Euler totient φ(n) | 10760 |
| Square | 260596449 |
| Cube | 4206808476207 |
| Square root | 127.055106 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.6143 × |
16143 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and forty-three |
| Binary (base 2) | 11111100001111 |
| Octal (base 8) | 37417 |
| Hexadecimal (base 16) | 3F0F |
| Base 3 | 211010220 |
| As time | 16143 seconds = 4 h 29 min 3 s |
Is 16143 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 (16143 ÷ 3 = 5381) | 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 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 6) | 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 16143 a prime number?
No. 16143 = 3 × 5381, so it is divisible by 3.
What are the factors of 16143?
1, 3, 5381, 16143.
What is 16143 in binary?
11111100001111 (hexadecimal 3F0F, octal 37417).
What is the square root of 16143?
About 127.0551.
Is 16143 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 16143?
16143 is a semiprime: 3 × 5381, the product of two primes.