The number 81369
81369 is a composite number with 6 divisors. Its prime factorisation is × 9041. Divisors (6): 1, 3, 9, 9041, 27123, 81369.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81369 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81369 is composite. Its prime factorisation is
- 3
The divisors add up to 117546; without 81369 itself that is 36177, so 81369 is deficient (36177 is less than 81369). Euler's totient φ(81369) = 54240 numbers up to 81369 share no factor with it.
- 4
The digits of 81369 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81369 = 3^{2} \times 9041 \]81369 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 117546 |
| Euler totient φ(n) | 54240 |
| Square | 6620914161 |
| Cube | 538737164366409 |
| Square root | 285.252520 (= 3√9041) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.1369 × |
81369 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand three hundred and sixty-nine |
| Binary (base 2) | 10011110111011001 |
| Octal (base 8) | 236731 |
| Hexadecimal (base 16) | 13DD9 |
| Base 3 | 11010121200 |
| As time | 81369 seconds = 22 h 36 min 9 s |
Is 81369 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 (81369 ÷ 3 = 27123) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (81369 ÷ 9 = 9041) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81369 a prime number?
No. 81369 = × 9041, so it is divisible by 3.
What are the factors of 81369?
1, 3, 9, 9041, 27123, 81369.
What is 81369 in binary?
10011110111011001 (hexadecimal 13DD9, octal 236731).
What is the square root of 81369?
About 285.2525, exactly 3√9041.
Is 81369 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 81369?
It is a composite number with 6 divisors.