The number 69006
69006 is a triangular number: 1 + 2 + … + 371 = 69006. Its prime factorisation is 2 × 3 × 7 × 31 × 53. Divisors (32): 1, 2, 3, 6, 7, 14, 21, 31, 42, 53, 62, 93, 106, 159, 186, 217 … 69006.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69006: a triangular number: 1 + 2 + … + 371 = 69006; a Harshad number: divisible by its digit sum 21.
- 2
69006 is composite. Its prime factorisation is
- 3
The divisors add up to 165888; without 69006 itself that is 96882, so 69006 is abundant (96882 is more than 69006). Euler's totient φ(69006) = 18720 numbers up to 69006 share no factor with it.
- 4
The digits of 69006 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
\[ 69006 = 2 \times 3 \times 7 \times 31 \times 53 \]
69006 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 165888 |
| Euler totient φ(n) | 18720 |
| Square | 4761828036 |
| Cube | 328594705452216 |
| Square root | 262.689931 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9006 × |
69006 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand and six |
| Binary (base 2) | 10000110110001110 |
| Octal (base 8) | 206616 |
| Hexadecimal (base 16) | 10D8E |
| Base 3 | 10111122210 |
| As time | 69006 seconds = 19 h 10 min 6 s |
Is 69006 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69006 ÷ 2 = 34503) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69006 ÷ 3 = 23002) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (69006 ÷ 6 = 11501) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (69006 ÷ 7 = 9858) | 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 6) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69006 a prime number?
No. 69006 = 2 × 3 × 7 × 31 × 53, so it is divisible by 2.
What are the factors of 69006?
1, 2, 3, 6, 7, 14, 21, 31, 42, 53, 62, 93, 106, 159, 186, 217, 318, 371, 434, 651, 742, 1113, 1302, 1643, 2226, 3286, 4929, 9858, 11501, 23002, 34503, 69006.
What is 69006 in binary?
10000110110001110 (hexadecimal 10D8E, octal 206616).
What is the square root of 69006?
About 262.6899.
Is 69006 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 69006?
69006 is a triangular number: 1 + 2 + … + 371 = 69006; a Harshad number: divisible by its digit sum 21.