The number 69960
69960 is a composite number with 64 divisors. Its prime factorisation is × 3 × 5 × 11 × 53. Divisors (64): 1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 15, 20, 22, 24, 30, 33 … 69960.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69960: a Harshad number: divisible by its digit sum 30.
- 2
69960 is composite. Its prime factorisation is
- 3
The divisors add up to 233280; without 69960 itself that is 163320, so 69960 is abundant (163320 is more than 69960). Euler's totient φ(69960) = 16640 numbers up to 69960 share no factor with it.
- 4
The digits of 69960 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
\[ 69960 = 2^{3} \times 3 \times 5 \times 11 \times 53 \]69960 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 64 |
| Sum of divisors | 233280 |
| Euler totient φ(n) | 16640 |
| Square | 4894401600 |
| Cube | 342412335936000 |
| Square root | 264.499527 (= 2√17490) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.996 × |
69960 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand nine hundred and sixty |
| Binary (base 2) | 10001000101001000 |
| Octal (base 8) | 210510 |
| Hexadecimal (base 16) | 11148 |
| Base 3 | 10112222010 |
| As time | 69960 seconds = 19 h 26 min 0 s |
Is 69960 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69960 ÷ 2 = 34980) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69960 ÷ 3 = 23320) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (69960 ÷ 4 = 17490) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69960 ÷ 5 = 13992) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (69960 ÷ 6 = 11660) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (69960 ÷ 8 = 8745) | 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 | Yes (69960 ÷ 10 = 6996) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (69960 ÷ 11 = 6360) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (69960 ÷ 12 = 5830) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69960 a prime number?
No. 69960 = × 3 × 5 × 11 × 53, so it is divisible by 2.
What are the factors of 69960?
1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 15, 20, 22, 24, 30, 33, 40, 44, 53, 55, 60, 66, 88, 106, 110, 120, 132, 159, 165, 212, 220, 264, 265, 318, 330, 424, 440, 530, 583, 636, 660, 795, 1060, 1166, 1272, 1320, 1590, 1749, 2120, 2332, 2915, 3180, 3498, 4664, 5830, 6360, 6996, 8745, 11660, 13992, 17490, 23320, 34980, 69960.
What is 69960 in binary?
10001000101001000 (hexadecimal 11148, octal 210510).
What is the square root of 69960?
About 264.4995, exactly 2√17490.
Is 69960 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 69960?
69960 is a Harshad number: divisible by its digit sum 30.