The number 30935
30935 is a composite number with 8 divisors. Its prime factorisation is 5 × 23 × 269. Divisors (8): 1, 5, 23, 115, 269, 1345, 6187, 30935.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30935 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30935 is composite. Its prime factorisation is
- 3
The divisors add up to 38880; without 30935 itself that is 7945, so 30935 is deficient (7945 is less than 30935). Euler's totient φ(30935) = 23584 numbers up to 30935 share no factor with it.
- 4
The digits of 30935 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 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30935 = 5 \times 23 \times 269 \]
30935 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 38880 |
| Euler totient φ(n) | 23584 |
| Square | 956974225 |
| Cube | 29603997650375 |
| Square root | 175.883484 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 85 |
| Scientific notation | 3.0935 × |
30935 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and thirty-five |
| Binary (base 2) | 111100011010111 |
| Octal (base 8) | 74327 |
| Hexadecimal (base 16) | 78D7 |
| Base 3 | 1120102202 |
| As time | 30935 seconds = 8 h 35 min 35 s |
Is 30935 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (30935 ÷ 5 = 6187) | 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 2) | 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 7) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30935 a prime number?
No. 30935 = 5 × 23 × 269, so it is divisible by 5.
What are the factors of 30935?
1, 5, 23, 115, 269, 1345, 6187, 30935.
What is 30935 in binary?
111100011010111 (hexadecimal 78D7, octal 74327).
What is the square root of 30935?
About 175.8835.
Is 30935 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 30935?
It is a composite number with 8 divisors.