The number 6933
6933 is a composite number with 4 divisors. Its prime factorisation is 3 × 2311. Divisors (4): 1, 3, 2311, 6933.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6933: a semiprime: 3 × 2311, the product of two primes.
- 2
6933 is composite. Its prime factorisation is
- 3
The divisors add up to 9248; without 6933 itself that is 2315, so 6933 is deficient (2315 is less than 6933). Euler's totient φ(6933) = 4620 numbers up to 6933 share no factor with it.
- 4
The digits of 6933 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 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6933 = 3 \times 2311 \]
6933 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9248 |
| Euler totient φ(n) | 4620 |
| Square | 48066489 |
| Cube | 333244968237 |
| Square root | 83.264638 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 31 |
| Scientific notation | 6.933 × |
6933 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and thirty-three |
| Binary (base 2) | 1101100010101 |
| Octal (base 8) | 15425 |
| Hexadecimal (base 16) | 1B15 |
| Base 3 | 100111210 |
| As time | 6933 seconds = 1 h 55 min 33 s |
Is 6933 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (6933 ÷ 3 = 2311) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6933 a prime number?
No. 6933 = 3 × 2311, so it is divisible by 3.
What are the factors of 6933?
1, 3, 2311, 6933.
What is 6933 in binary?
1101100010101 (hexadecimal 1B15, octal 15425).
What is the square root of 6933?
About 83.2646.
Is 6933 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 6933?
6933 is a semiprime: 3 × 2311, the product of two primes.