The number 69330
69330 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2311. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2311, 4622, 6933, 11555, 13866, 23110, 34665, 69330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69330 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69330 is composite. Its prime factorisation is
- 3
The divisors add up to 166464; without 69330 itself that is 97134, so 69330 is abundant (97134 is more than 69330). Euler's totient φ(69330) = 18480 numbers up to 69330 share no factor with it.
- 4
The digits of 69330 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
\[ 69330 = 2 \times 3 \times 5 \times 2311 \]
69330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 166464 |
| Euler totient φ(n) | 18480 |
| Square | 4806648900 |
| Cube | 333244968237000 |
| Square root | 263.305906 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.933 × |
69330 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand three hundred and thirty |
| Binary (base 2) | 10000111011010010 |
| Octal (base 8) | 207322 |
| Hexadecimal (base 16) | 10ED2 |
| Base 3 | 10112002210 |
| As time | 69330 seconds = 19 h 15 min 30 s |
Is 69330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69330 ÷ 2 = 34665) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69330 ÷ 3 = 23110) | 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 (69330 ÷ 5 = 13866) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (69330 ÷ 6 = 11555) | 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 | 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 (69330 ÷ 10 = 6933) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 69330 a prime number?
No. 69330 = 2 × 3 × 5 × 2311, so it is divisible by 2.
What are the factors of 69330?
1, 2, 3, 5, 6, 10, 15, 30, 2311, 4622, 6933, 11555, 13866, 23110, 34665, 69330.
What is 69330 in binary?
10000111011010010 (hexadecimal 10ED2, octal 207322).
What is the square root of 69330?
About 263.3059.
Is 69330 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 69330?
It is a composite number with 16 divisors.