The number 69520
69520 is a composite number with 40 divisors. Its prime factorisation is × 5 × 11 × 79. Divisors (40): 1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 40, 44, 55, 79, 80, 88 … 69520.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69520: a Harshad number: divisible by its digit sum 22.
- 2
69520 is composite. Its prime factorisation is
- 3
The divisors add up to 178560; without 69520 itself that is 109040, so 69520 is abundant (109040 is more than 69520). Euler's totient φ(69520) = 24960 numbers up to 69520 share no factor with it.
- 4
The digits of 69520 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69520 = 2^{4} \times 5 \times 11 \times 79 \]69520 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 178560 |
| Euler totient φ(n) | 24960 |
| Square | 4833030400 |
| Cube | 335992273408000 |
| Square root | 263.666456 (= 4√4345) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.952 × |
69520 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand five hundred and twenty |
| Binary (base 2) | 10000111110010000 |
| Octal (base 8) | 207620 |
| Hexadecimal (base 16) | 10F90 |
| Base 3 | 10112100211 |
| As time | 69520 seconds = 19 h 18 min 40 s |
Is 69520 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69520 ÷ 2 = 34760) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (69520 ÷ 4 = 17380) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69520 ÷ 5 = 13904) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | Yes (69520 ÷ 8 = 8690) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (69520 ÷ 10 = 6952) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (69520 ÷ 11 = 6320) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69520 a prime number?
No. 69520 = × 5 × 11 × 79, so it is divisible by 2.
What are the factors of 69520?
1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 40, 44, 55, 79, 80, 88, 110, 158, 176, 220, 316, 395, 440, 632, 790, 869, 880, 1264, 1580, 1738, 3160, 3476, 4345, 6320, 6952, 8690, 13904, 17380, 34760, 69520.
What is 69520 in binary?
10000111110010000 (hexadecimal 10F90, octal 207620).
What is the square root of 69520?
About 263.6665, exactly 4√4345.
Is 69520 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 69520?
69520 is a Harshad number: divisible by its digit sum 22.