The number 69060
69060 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 1151. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 1151, 2302, 3453, 4604 … 69060.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69060 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69060 is composite. Its prime factorisation is
- 3
The divisors add up to 193536; without 69060 itself that is 124476, so 69060 is abundant (124476 is more than 69060). Euler's totient φ(69060) = 18400 numbers up to 69060 share no factor with it.
- 4
The digits of 69060 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69060 = 2^{2} \times 3 \times 5 \times 1151 \]69060 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 193536 |
| Euler totient φ(n) | 18400 |
| Square | 4769283600 |
| Cube | 329366725416000 |
| Square root | 262.792694 (= 2√17265) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.906 × |
69060 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand and sixty |
| Binary (base 2) | 10000110111000100 |
| Octal (base 8) | 206704 |
| Hexadecimal (base 16) | 10DC4 |
| Base 3 | 10111201210 |
| As time | 69060 seconds = 19 h 11 min 0 s |
Is 69060 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69060 ÷ 2 = 34530) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69060 ÷ 3 = 23020) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (69060 ÷ 4 = 17265) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69060 ÷ 5 = 13812) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (69060 ÷ 6 = 11510) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (69060 ÷ 10 = 6906) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (69060 ÷ 12 = 5755) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69060 a prime number?
No. 69060 = × 3 × 5 × 1151, so it is divisible by 2.
What are the factors of 69060?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 1151, 2302, 3453, 4604, 5755, 6906, 11510, 13812, 17265, 23020, 34530, 69060.
What is 69060 in binary?
10000110111000100 (hexadecimal 10DC4, octal 206704).
What is the square root of 69060?
About 262.7927, exactly 2√17265.
Is 69060 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 69060?
It is a composite number with 24 divisors.