The number 30922
30922 is a composite number with 4 divisors. Its prime factorisation is 2 × 15461. Divisors (4): 1, 2, 15461, 30922.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30922: a semiprime: 2 × 15461, the product of two primes.
- 2
30922 is composite. Its prime factorisation is
- 3
The divisors add up to 46386; without 30922 itself that is 15464, so 30922 is deficient (15464 is less than 30922). Euler's totient φ(30922) = 15460 numbers up to 30922 share no factor with it.
- 4
The digits of 30922 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30922 = 2 \times 15461 \]
30922 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 46386 |
| Euler totient φ(n) | 15460 |
| Square | 956170084 |
| Cube | 29566691337448 |
| Square root | 175.846524 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 147 |
| Scientific notation | 3.0922 × |
30922 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and twenty-two |
| Binary (base 2) | 111100011001010 |
| Octal (base 8) | 74312 |
| Hexadecimal (base 16) | 78CA |
| Base 3 | 1120102021 |
| As time | 30922 seconds = 8 h 35 min 22 s |
Is 30922 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30922 ÷ 2 = 15461) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 1) | 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 30922 a prime number?
No. 30922 = 2 × 15461, so it is divisible by 2.
What are the factors of 30922?
1, 2, 15461, 30922.
What is 30922 in binary?
111100011001010 (hexadecimal 78CA, octal 74312).
What is the square root of 30922?
About 175.8465.
Is 30922 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 30922?
30922 is a semiprime: 2 × 15461, the product of two primes.