The number 81143
81143 is a composite number with 4 divisors. Its prime factorisation is 53 × 1531. Divisors (4): 1, 53, 1531, 81143.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81143: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 53 × 1531, the product of two primes.
- 2
81143 is composite. Its prime factorisation is
- 3
The divisors add up to 82728; without 81143 itself that is 1585, so 81143 is deficient (1585 is less than 81143). Euler's totient φ(81143) = 79560 numbers up to 81143 share no factor with it.
- 4
The digits of 81143 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81143 = 53 \times 1531 \]
81143 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 82728 |
| Euler totient φ(n) | 79560 |
| Square | 6584186449 |
| Cube | 534260641031207 |
| Square root | 284.856104 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.1143 × |
81143 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand one hundred and forty-three |
| Binary (base 2) | 10011110011110111 |
| Octal (base 8) | 236367 |
| Hexadecimal (base 16) | 13CF7 |
| Base 3 | 11010022022 |
| As time | 81143 seconds = 22 h 32 min 23 s |
Is 81143 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 8) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81143 a prime number?
No. 81143 = 53 × 1531, so it is divisible by 53.
What are the factors of 81143?
1, 53, 1531, 81143.
What is 81143 in binary?
10011110011110111 (hexadecimal 13CF7, octal 236367).
What is the square root of 81143?
About 284.8561.
Is 81143 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 81143?
81143 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 53 × 1531, the product of two primes.