The number 69212
69212 is a composite number with 24 divisors. Its prime factorisation is × × 13. Divisors (24): 1, 2, 4, 11, 13, 22, 26, 44, 52, 121, 143, 242, 286, 484, 572, 1331 … 69212.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69212 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69212 is composite. Its prime factorisation is
- 3
The divisors add up to 143472; without 69212 itself that is 74260, so 69212 is abundant (74260 is more than 69212). Euler's totient φ(69212) = 29040 numbers up to 69212 share no factor with it.
- 4
The digits of 69212 add up to 20, 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
\[ 69212 = 2^{2} \times 11^{3} \times 13 \]69212 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 143472 |
| Euler totient φ(n) | 29040 |
| Square | 4790300944 |
| Cube | 331546308936128 |
| Square root | 263.081736 (= 22√143) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.9212 × |
69212 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand two hundred and twelve |
| Binary (base 2) | 10000111001011100 |
| Octal (base 8) | 207134 |
| Hexadecimal (base 16) | 10E5C |
| Base 3 | 10111221102 |
| As time | 69212 seconds = 19 h 13 min 32 s |
Is 69212 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69212 ÷ 2 = 34606) | 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 | Yes (69212 ÷ 4 = 17303) | 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 | 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 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 | Yes (69212 ÷ 11 = 6292) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69212 a prime number?
No. 69212 = × × 13, so it is divisible by 2.
What are the factors of 69212?
1, 2, 4, 11, 13, 22, 26, 44, 52, 121, 143, 242, 286, 484, 572, 1331, 1573, 2662, 3146, 5324, 6292, 17303, 34606, 69212.
What is 69212 in binary?
10000111001011100 (hexadecimal 10E5C, octal 207134).
What is the square root of 69212?
About 263.0817, exactly 22√143.
Is 69212 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 69212?
It is a composite number with 24 divisors.