The number 30929
30929 is a composite number with 4 divisors. Its prime factorisation is 157 × 197. Divisors (4): 1, 157, 197, 30929.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30929: a semiprime: 157 × 197, the product of two primes.
- 2
30929 is composite. Its prime factorisation is
- 3
The divisors add up to 31284; without 30929 itself that is 355, so 30929 is deficient (355 is less than 30929). Euler's totient φ(30929) = 30576 numbers up to 30929 share no factor with it.
- 4
The digits of 30929 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 209 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30929 = 157 \times 197 \]
30929 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 31284 |
| Euler totient φ(n) | 30576 |
| Square | 956603041 |
| Cube | 29586775455089 |
| Square root | 175.866427 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 209 |
| Scientific notation | 3.0929 × |
30929 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and twenty-nine |
| Binary (base 2) | 111100011010001 |
| Octal (base 8) | 74321 |
| Hexadecimal (base 16) | 78D1 |
| Base 3 | 1120102112 |
| As time | 30929 seconds = 8 h 35 min 29 s |
Is 30929 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 | No (remainder 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30929 a prime number?
No. 30929 = 157 × 197, so it is divisible by 157.
What are the factors of 30929?
1, 157, 197, 30929.
What is 30929 in binary?
111100011010001 (hexadecimal 78D1, octal 74321).
What is the square root of 30929?
About 175.8664.
Is 30929 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 30929?
30929 is a semiprime: 157 × 197, the product of two primes.