The number 69381
69381 is a composite number with 12 divisors. Its prime factorisation is × 13 × 593. Divisors (12): 1, 3, 9, 13, 39, 117, 593, 1779, 5337, 7709, 23127, 69381.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69381 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69381 is composite. Its prime factorisation is
- 3
The divisors add up to 108108; without 69381 itself that is 38727, so 69381 is deficient (38727 is less than 69381). Euler's totient φ(69381) = 42624 numbers up to 69381 share no factor with it.
- 4
The digits of 69381 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 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69381 = 3^{2} \times 13 \times 593 \]69381 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 108108 |
| Euler totient φ(n) | 42624 |
| Square | 4813723161 |
| Cube | 333980926633341 |
| Square root | 263.402733 (= 3√7709) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.9381 × |
69381 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand three hundred and eighty-one |
| Binary (base 2) | 10000111100000101 |
| Octal (base 8) | 207405 |
| Hexadecimal (base 16) | 10F05 |
| Base 3 | 10112011200 |
| As time | 69381 seconds = 19 h 16 min 21 s |
Is 69381 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 (69381 ÷ 3 = 23127) | 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 1) | 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 4) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (69381 ÷ 9 = 7709) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 69381 a prime number?
No. 69381 = × 13 × 593, so it is divisible by 3.
What are the factors of 69381?
1, 3, 9, 13, 39, 117, 593, 1779, 5337, 7709, 23127, 69381.
What is 69381 in binary?
10000111100000101 (hexadecimal 10F05, octal 207405).
What is the square root of 69381?
About 263.4027, exactly 3√7709.
Is 69381 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 69381?
It is a composite number with 12 divisors.