The number 69482
69482 is a composite number with 12 divisors. Its prime factorisation is 2 × × 709. Divisors (12): 1, 2, 7, 14, 49, 98, 709, 1418, 4963, 9926, 34741, 69482.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69482 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69482 is composite. Its prime factorisation is
- 3
The divisors add up to 121410; without 69482 itself that is 51928, so 69482 is deficient (51928 is less than 69482). Euler's totient φ(69482) = 29736 numbers up to 69482 share no factor with it.
- 4
The digits of 69482 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69482 = 2 \times 7^{2} \times 709 \]69482 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 121410 |
| Euler totient φ(n) | 29736 |
| Square | 4827748324 |
| Cube | 335441609048168 |
| Square root | 263.594385 (= 7√1418) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.9482 × |
69482 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand four hundred and eighty-two |
| Binary (base 2) | 10000111101101010 |
| Octal (base 8) | 207552 |
| Hexadecimal (base 16) | 10F6A |
| Base 3 | 10112022102 |
| As time | 69482 seconds = 19 h 18 min 2 s |
Is 69482 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69482 ÷ 2 = 34741) | 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 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (69482 ÷ 7 = 9926) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69482 a prime number?
No. 69482 = 2 × × 709, so it is divisible by 2.
What are the factors of 69482?
1, 2, 7, 14, 49, 98, 709, 1418, 4963, 9926, 34741, 69482.
What is 69482 in binary?
10000111101101010 (hexadecimal 10F6A, octal 207552).
What is the square root of 69482?
About 263.5944, exactly 7√1418.
Is 69482 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 69482?
It is a composite number with 12 divisors.