The number 30691
30691 is a composite number with 4 divisors. Its prime factorisation is 47 × 653. Divisors (4): 1, 47, 653, 30691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30691: a semiprime: 47 × 653, the product of two primes.
- 2
30691 is composite. Its prime factorisation is
- 3
The divisors add up to 31392; without 30691 itself that is 701, so 30691 is deficient (701 is less than 30691). Euler's totient φ(30691) = 29992 numbers up to 30691 share no factor with it.
- 4
The digits of 30691 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30691 = 47 \times 653 \]
30691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 31392 |
| Euler totient φ(n) | 29992 |
| Square | 941937481 |
| Cube | 28909003229371 |
| Square root | 175.188470 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 59 |
| Scientific notation | 3.0691 × |
30691 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand six hundred and ninety-one |
| Binary (base 2) | 111011111100011 |
| Octal (base 8) | 73743 |
| Hexadecimal (base 16) | 77E3 |
| Base 3 | 1120002201 |
| As time | 30691 seconds = 8 h 31 min 31 s |
Is 30691 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | 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 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30691 a prime number?
No. 30691 = 47 × 653, so it is divisible by 47.
What are the factors of 30691?
1, 47, 653, 30691.
What is 30691 in binary?
111011111100011 (hexadecimal 77E3, octal 73743).
What is the square root of 30691?
About 175.1885.
Is 30691 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 30691?
30691 is a semiprime: 47 × 653, the product of two primes.