The number 69552
69552 is a composite number with 80 divisors. Its prime factorisation is × × 7 × 23. Divisors (80): 1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 16, 18, 21, 23, 24, 27 … 69552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69552: a Harshad number: divisible by its digit sum 27.
- 2
69552 is composite. Its prime factorisation is
- 3
The divisors add up to 238080; without 69552 itself that is 168528, so 69552 is abundant (168528 is more than 69552). Euler's totient φ(69552) = 19008 numbers up to 69552 share no factor with it.
- 4
The digits of 69552 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 187 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69552 = 2^{4} \times 3^{3} \times 7 \times 23 \]69552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 80 |
| Sum of divisors | 238080 |
| Euler totient φ(n) | 19008 |
| Square | 4837480704 |
| Cube | 336456457924608 |
| Square root | 263.727132 (= 12√483) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 187 |
| Scientific notation | 6.9552 × |
69552 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand five hundred and fifty-two |
| Binary (base 2) | 10000111110110000 |
| Octal (base 8) | 207660 |
| Hexadecimal (base 16) | 10FB0 |
| Base 3 | 10112102000 |
| As time | 69552 seconds = 19 h 19 min 12 s |
Is 69552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69552 ÷ 2 = 34776) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69552 ÷ 3 = 23184) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (69552 ÷ 4 = 17388) | 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 (69552 ÷ 6 = 11592) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (69552 ÷ 7 = 9936) | 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 | Yes (69552 ÷ 8 = 8694) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (69552 ÷ 9 = 7728) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (69552 ÷ 12 = 5796) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69552 a prime number?
No. 69552 = × × 7 × 23, so it is divisible by 2.
What are the factors of 69552?
1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 16, 18, 21, 23, 24, 27, 28, 36, 42, 46, 48, 54, 56, 63, 69, 72, 84, 92, 108, 112, 126, 138, 144, 161, 168, 184, 189, 207, 216, 252, 276, 322, 336, 368, 378, 414, 432, 483, 504, 552, 621, 644, 756, 828, 966, 1008, 1104, 1242, 1288, 1449, 1512, 1656, 1932, 2484, 2576, 2898, 3024, 3312, 3864, 4347, 4968, 5796, 7728, 8694, 9936, 11592, 17388, 23184, 34776, 69552.
What is 69552 in binary?
10000111110110000 (hexadecimal 10FB0, octal 207660).
What is the square root of 69552?
About 263.7271, exactly 12√483.
Is 69552 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 69552?
69552 is a Harshad number: divisible by its digit sum 27.