The number 6930
6930 is a composite number with 48 divisors. Its prime factorisation is 2 × × 5 × 7 × 11. Divisors (48): 1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 18, 21, 22, 30, 33 … 6930.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6930: a Harshad number: divisible by its digit sum 18.
- 2
6930 is composite. Its prime factorisation is
- 3
The divisors add up to 22464; without 6930 itself that is 15534, so 6930 is abundant (15534 is more than 6930). Euler's totient φ(6930) = 1440 numbers up to 6930 share no factor with it.
- 4
The digits of 6930 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 150 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6930 = 2 \times 3^{2} \times 5 \times 7 \times 11 \]6930 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 22464 |
| Euler totient φ(n) | 1440 |
| Square | 48024900 |
| Cube | 332812557000 |
| Square root | 83.246622 (= 3√770) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 150 |
| Scientific notation | 6.93 × |
6930 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and thirty |
| Binary (base 2) | 1101100010010 |
| Octal (base 8) | 15422 |
| Hexadecimal (base 16) | 1B12 |
| Base 3 | 100111200 |
| As time | 6930 seconds = 1 h 55 min 30 s |
Is 6930 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6930 ÷ 2 = 3465) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (6930 ÷ 3 = 2310) | 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 (6930 ÷ 5 = 1386) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (6930 ÷ 6 = 1155) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (6930 ÷ 7 = 990) | 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 | Yes (6930 ÷ 9 = 770) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (6930 ÷ 10 = 693) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (6930 ÷ 11 = 630) | 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 6930 a prime number?
No. 6930 = 2 × × 5 × 7 × 11, so it is divisible by 2.
What are the factors of 6930?
1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 18, 21, 22, 30, 33, 35, 42, 45, 55, 63, 66, 70, 77, 90, 99, 105, 110, 126, 154, 165, 198, 210, 231, 315, 330, 385, 462, 495, 630, 693, 770, 990, 1155, 1386, 2310, 3465, 6930.
What is 6930 in binary?
1101100010010 (hexadecimal 1B12, octal 15422).
What is the square root of 6930?
About 83.2466, exactly 3√770.
Is 6930 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 6930?
6930 is a Harshad number: divisible by its digit sum 18.