The number 30692
30692 is a composite number with 6 divisors. Its prime factorisation is × 7673. Divisors (6): 1, 2, 4, 7673, 15346, 30692.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30692: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
30692 is composite. Its prime factorisation is
- 3
The divisors add up to 53718; without 30692 itself that is 23026, so 30692 is deficient (23026 is less than 30692). Euler's totient φ(30692) = 15344 numbers up to 30692 share no factor with it.
- 4
The digits of 30692 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30692 = 2^{2} \times 7673 \]30692 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 53718 |
| Euler totient φ(n) | 15344 |
| Square | 941998864 |
| Cube | 28911829133888 |
| Square root | 175.191324 (= 2√7673) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 59 |
| Scientific notation | 3.0692 × |
30692 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand six hundred and ninety-two |
| Binary (base 2) | 111011111100100 |
| Octal (base 8) | 73744 |
| Hexadecimal (base 16) | 77E4 |
| Base 3 | 1120002202 |
| As time | 30692 seconds = 8 h 31 min 32 s |
Is 30692 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30692 ÷ 2 = 15346) | 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 | Yes (30692 ÷ 4 = 7673) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30692 a prime number?
No. 30692 = × 7673, so it is divisible by 2.
What are the factors of 30692?
1, 2, 4, 7673, 15346, 30692.
What is 30692 in binary?
111011111100100 (hexadecimal 77E4, octal 73744).
What is the square root of 30692?
About 175.1913, exactly 2√7673.
Is 30692 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 30692?
30692 is a happy number: repeatedly adding the squares of its digits reaches 1.