The number 30822
30822 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 11 × 467. Divisors (16): 1, 2, 3, 6, 11, 22, 33, 66, 467, 934, 1401, 2802, 5137, 10274, 15411, 30822.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30822 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30822 is composite. Its prime factorisation is
- 3
The divisors add up to 67392; without 30822 itself that is 36570, so 30822 is abundant (36570 is more than 30822). Euler's totient φ(30822) = 9320 numbers up to 30822 share no factor with it.
- 4
The digits of 30822 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30822 = 2 \times 3 \times 11 \times 467 \]
30822 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 67392 |
| Euler totient φ(n) | 9320 |
| Square | 949995684 |
| Cube | 29280766972248 |
| Square root | 175.561955 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 147 |
| Scientific notation | 3.0822 × |
30822 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand eight hundred and twenty-two |
| Binary (base 2) | 111100001100110 |
| Octal (base 8) | 74146 |
| Hexadecimal (base 16) | 7866 |
| Base 3 | 1120021120 |
| As time | 30822 seconds = 8 h 33 min 42 s |
Is 30822 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30822 ÷ 2 = 15411) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (30822 ÷ 3 = 10274) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (30822 ÷ 6 = 5137) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (30822 ÷ 11 = 2802) | 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 30822 a prime number?
No. 30822 = 2 × 3 × 11 × 467, so it is divisible by 2.
What are the factors of 30822?
1, 2, 3, 6, 11, 22, 33, 66, 467, 934, 1401, 2802, 5137, 10274, 15411, 30822.
What is 30822 in binary?
111100001100110 (hexadecimal 7866, octal 74146).
What is the square root of 30822?
About 175.5620.
Is 30822 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 30822?
It is a composite number with 16 divisors.