The number 69690
69690 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 23 × 101. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 23, 30, 46, 69, 101, 115, 138, 202, 230 … 69690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69690: a Harshad number: divisible by its digit sum 30.
- 2
69690 is composite. Its prime factorisation is
- 3
The divisors add up to 176256; without 69690 itself that is 106566, so 69690 is abundant (106566 is more than 69690). Euler's totient φ(69690) = 17600 numbers up to 69690 share no factor with it.
- 4
The digits of 69690 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 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69690 = 2 \times 3 \times 5 \times 23 \times 101 \]
69690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 176256 |
| Euler totient φ(n) | 17600 |
| Square | 4856696100 |
| Cube | 338463151209000 |
| Square root | 263.988636 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 112 |
| Scientific notation | 6.969 × |
69690 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand six hundred and ninety |
| Binary (base 2) | 10001000000111010 |
| Octal (base 8) | 210072 |
| Hexadecimal (base 16) | 1103A |
| Base 3 | 10112121010 |
| As time | 69690 seconds = 19 h 21 min 30 s |
Is 69690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69690 ÷ 2 = 34845) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69690 ÷ 3 = 23230) | 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 | Yes (69690 ÷ 5 = 13938) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (69690 ÷ 6 = 11615) | 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 2) | 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 (69690 ÷ 10 = 6969) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 69690 a prime number?
No. 69690 = 2 × 3 × 5 × 23 × 101, so it is divisible by 2.
What are the factors of 69690?
1, 2, 3, 5, 6, 10, 15, 23, 30, 46, 69, 101, 115, 138, 202, 230, 303, 345, 505, 606, 690, 1010, 1515, 2323, 3030, 4646, 6969, 11615, 13938, 23230, 34845, 69690.
What is 69690 in binary?
10001000000111010 (hexadecimal 1103A, octal 210072).
What is the square root of 69690?
About 263.9886.
Is 69690 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 69690?
69690 is a Harshad number: divisible by its digit sum 30.