The number 69382
69382 is a composite number with 8 divisors. Its prime factorisation is 2 × 113 × 307. Divisors (8): 1, 2, 113, 226, 307, 614, 34691, 69382.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69382 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69382 is composite. Its prime factorisation is
- 3
The divisors add up to 105336; without 69382 itself that is 35954, so 69382 is deficient (35954 is less than 69382). Euler's totient φ(69382) = 34272 numbers up to 69382 share no factor with it.
- 4
The digits of 69382 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69382 = 2 \times 113 \times 307 \]
69382 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 105336 |
| Euler totient φ(n) | 34272 |
| Square | 4813861924 |
| Cube | 333995368010968 |
| Square root | 263.404632 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.9382 × |
69382 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand three hundred and eighty-two |
| Binary (base 2) | 10000111100000110 |
| Octal (base 8) | 207406 |
| Hexadecimal (base 16) | 10F06 |
| Base 3 | 10112011201 |
| As time | 69382 seconds = 19 h 16 min 22 s |
Is 69382 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69382 ÷ 2 = 34691) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69382 a prime number?
No. 69382 = 2 × 113 × 307, so it is divisible by 2.
What are the factors of 69382?
1, 2, 113, 226, 307, 614, 34691, 69382.
What is 69382 in binary?
10000111100000110 (hexadecimal 10F06, octal 207406).
What is the square root of 69382?
About 263.4046.
Is 69382 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 69382?
It is a composite number with 8 divisors.