The number 69132
69132 is a composite number with 24 divisors. Its prime factorisation is × 3 × 7 × 823. Divisors (24): 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 823, 1646, 2469, 3292 … 69132.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69132: a Harshad number: divisible by its digit sum 21.
- 2
69132 is composite. Its prime factorisation is
- 3
The divisors add up to 184576; without 69132 itself that is 115444, so 69132 is abundant (115444 is more than 69132). Euler's totient φ(69132) = 19728 numbers up to 69132 share no factor with it.
- 4
The digits of 69132 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69132 = 2^{2} \times 3 \times 7 \times 823 \]69132 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 184576 |
| Euler totient φ(n) | 19728 |
| Square | 4779233424 |
| Cube | 330397965067968 |
| Square root | 262.929648 (= 2√17283) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9132 × |
69132 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand one hundred and thirty-two |
| Binary (base 2) | 10000111000001100 |
| Octal (base 8) | 207014 |
| Hexadecimal (base 16) | 10E0C |
| Base 3 | 10111211110 |
| As time | 69132 seconds = 19 h 12 min 12 s |
Is 69132 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69132 ÷ 2 = 34566) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69132 ÷ 3 = 23044) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (69132 ÷ 4 = 17283) | 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 (69132 ÷ 6 = 11522) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (69132 ÷ 7 = 9876) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (69132 ÷ 12 = 5761) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69132 a prime number?
No. 69132 = × 3 × 7 × 823, so it is divisible by 2.
What are the factors of 69132?
1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 823, 1646, 2469, 3292, 4938, 5761, 9876, 11522, 17283, 23044, 34566, 69132.
What is 69132 in binary?
10000111000001100 (hexadecimal 10E0C, octal 207014).
What is the square root of 69132?
About 262.9296, exactly 2√17283.
Is 69132 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 69132?
69132 is a Harshad number: divisible by its digit sum 21.