The number 69492
69492 is a composite number with 12 divisors. Its prime factorisation is × 3 × 5791. Divisors (12): 1, 2, 3, 4, 6, 12, 5791, 11582, 17373, 23164, 34746, 69492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69492 is composite. Its prime factorisation is
- 3
The divisors add up to 162176; without 69492 itself that is 92684, so 69492 is abundant (92684 is more than 69492). Euler's totient φ(69492) = 23160 numbers up to 69492 share no factor with it.
- 4
The digits of 69492 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69492 = 2^{2} \times 3 \times 5791 \]69492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 162176 |
| Euler totient φ(n) | 23160 |
| Square | 4829138064 |
| Cube | 335586462343488 |
| Square root | 263.613353 (= 2√17373) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.9492 × |
69492 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand four hundred and ninety-two |
| Binary (base 2) | 10000111101110100 |
| Octal (base 8) | 207564 |
| Hexadecimal (base 16) | 10F74 |
| Base 3 | 10112022210 |
| As time | 69492 seconds = 19 h 18 min 12 s |
Is 69492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69492 ÷ 2 = 34746) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69492 ÷ 3 = 23164) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (69492 ÷ 4 = 17373) | 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 | Yes (69492 ÷ 6 = 11582) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | Yes (69492 ÷ 12 = 5791) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69492 a prime number?
No. 69492 = × 3 × 5791, so it is divisible by 2.
What are the factors of 69492?
1, 2, 3, 4, 6, 12, 5791, 11582, 17373, 23164, 34746, 69492.
What is 69492 in binary?
10000111101110100 (hexadecimal 10F74, octal 207564).
What is the square root of 69492?
About 263.6134, exactly 2√17373.
Is 69492 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 69492?
It is a composite number with 12 divisors.