The number 30322
30322 is a composite number with 4 divisors. Its prime factorisation is 2 × 15161. Divisors (4): 1, 2, 15161, 30322.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30322: a semiprime: 2 × 15161, the product of two primes.
- 2
30322 is composite. Its prime factorisation is
- 3
The divisors add up to 45486; without 30322 itself that is 15164, so 30322 is deficient (15164 is less than 30322). Euler's totient φ(30322) = 15160 numbers up to 30322 share no factor with it.
- 4
The digits of 30322 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30322 = 2 \times 15161 \]
30322 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 45486 |
| Euler totient φ(n) | 15160 |
| Square | 919423684 |
| Cube | 27878764946248 |
| Square root | 174.132134 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 85 |
| Scientific notation | 3.0322 × |
30322 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand three hundred and twenty-two |
| Binary (base 2) | 111011001110010 |
| Octal (base 8) | 73162 |
| Hexadecimal (base 16) | 7672 |
| Base 3 | 1112121001 |
| As time | 30322 seconds = 8 h 25 min 22 s |
Is 30322 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30322 ÷ 2 = 15161) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | No (remainder 4) | 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 1) | 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 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30322 a prime number?
No. 30322 = 2 × 15161, so it is divisible by 2.
What are the factors of 30322?
1, 2, 15161, 30322.
What is 30322 in binary?
111011001110010 (hexadecimal 7672, octal 73162).
What is the square root of 30322?
About 174.1321.
Is 30322 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 30322?
30322 is a semiprime: 2 × 15161, the product of two primes.