The number 10143
10143 is a composite number with 18 divisors. Its prime factorisation is × × 23. Divisors (18): 1, 3, 7, 9, 21, 23, 49, 63, 69, 147, 161, 207, 441, 483, 1127, 1449 … 10143.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10143: a Harshad number: divisible by its digit sum 9.
- 2
10143 is composite. Its prime factorisation is
- 3
The divisors add up to 17784; without 10143 itself that is 7641, so 10143 is deficient (7641 is less than 10143). Euler's totient φ(10143) = 5544 numbers up to 10143 share no factor with it.
- 4
The digits of 10143 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10143 = 3^{2} \times 7^{2} \times 23 \]10143 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 17784 |
| Euler totient φ(n) | 5544 |
| Square | 102880449 |
| Cube | 1043516394207 |
| Square root | 100.712462 (= 21√23) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 117 |
| Scientific notation | 1.0143 × |
10143 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and forty-three |
| Binary (base 2) | 10011110011111 |
| Octal (base 8) | 23637 |
| Hexadecimal (base 16) | 279F |
| Base 3 | 111220200 |
| As time | 10143 seconds = 2 h 49 min 3 s |
Is 10143 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 (10143 ÷ 3 = 3381) | 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 | Yes (10143 ÷ 7 = 1449) | 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 | Yes (10143 ÷ 9 = 1127) | 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 1) | 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 10143 a prime number?
No. 10143 = × × 23, so it is divisible by 3.
What are the factors of 10143?
1, 3, 7, 9, 21, 23, 49, 63, 69, 147, 161, 207, 441, 483, 1127, 1449, 3381, 10143.
What is 10143 in binary?
10011110011111 (hexadecimal 279F, octal 23637).
What is the square root of 10143?
About 100.7125, exactly 21√23.
Is 10143 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 10143?
10143 is a Harshad number: divisible by its digit sum 9.