The number 30681
30681 is a composite number with 12 divisors. Its prime factorisation is × 7 × 487. Divisors (12): 1, 3, 7, 9, 21, 63, 487, 1461, 3409, 4383, 10227, 30681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30681 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30681 is composite. Its prime factorisation is
- 3
The divisors add up to 50752; without 30681 itself that is 20071, so 30681 is deficient (20071 is less than 30681). Euler's totient φ(30681) = 17496 numbers up to 30681 share no factor with it.
- 4
The digits of 30681 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30681 = 3^{2} \times 7 \times 487 \]30681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 50752 |
| Euler totient φ(n) | 17496 |
| Square | 941323761 |
| Cube | 28880754311241 |
| Square root | 175.159927 (= 3√3409) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 59 |
| Scientific notation | 3.0681 × |
30681 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand six hundred and eighty-one |
| Binary (base 2) | 111011111011001 |
| Octal (base 8) | 73731 |
| Hexadecimal (base 16) | 77D9 |
| Base 3 | 1120002100 |
| As time | 30681 seconds = 8 h 31 min 21 s |
Is 30681 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 | Yes (30681 ÷ 3 = 10227) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (30681 ÷ 7 = 4383) | 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 | Yes (30681 ÷ 9 = 3409) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30681 a prime number?
No. 30681 = × 7 × 487, so it is divisible by 3.
What are the factors of 30681?
1, 3, 7, 9, 21, 63, 487, 1461, 3409, 4383, 10227, 30681.
What is 30681 in binary?
111011111011001 (hexadecimal 77D9, octal 73731).
What is the square root of 30681?
About 175.1599, exactly 3√3409.
Is 30681 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 30681?
It is a composite number with 12 divisors.