The number 30952
30952 is a composite number with 16 divisors. Its prime factorisation is × 53 × 73. Divisors (16): 1, 2, 4, 8, 53, 73, 106, 146, 212, 292, 424, 584, 3869, 7738, 15476, 30952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30952 is composite. Its prime factorisation is
- 3
The divisors add up to 59940; without 30952 itself that is 28988, so 30952 is deficient (28988 is less than 30952). Euler's totient φ(30952) = 14976 numbers up to 30952 share no factor with it.
- 4
The digits of 30952 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 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30952 = 2^{3} \times 53 \times 73 \]30952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 59940 |
| Euler totient φ(n) | 14976 |
| Square | 958026304 |
| Cube | 29652830161408 |
| Square root | 175.931805 (= 2√7738) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 147 |
| Scientific notation | 3.0952 × |
30952 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and fifty-two |
| Binary (base 2) | 111100011101000 |
| Octal (base 8) | 74350 |
| Hexadecimal (base 16) | 78E8 |
| Base 3 | 1120110101 |
| As time | 30952 seconds = 8 h 35 min 52 s |
Is 30952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30952 ÷ 2 = 15476) | 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 | Yes (30952 ÷ 4 = 7738) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (30952 ÷ 8 = 3869) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30952 a prime number?
No. 30952 = × 53 × 73, so it is divisible by 2.
What are the factors of 30952?
1, 2, 4, 8, 53, 73, 106, 146, 212, 292, 424, 584, 3869, 7738, 15476, 30952.
What is 30952 in binary?
111100011101000 (hexadecimal 78E8, octal 74350).
What is the square root of 30952?
About 175.9318, exactly 2√7738.
Is 30952 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 30952?
It is a composite number with 16 divisors.