The number 30948
30948 is a composite number with 12 divisors. Its prime factorisation is × 3 × 2579. Divisors (12): 1, 2, 3, 4, 6, 12, 2579, 5158, 7737, 10316, 15474, 30948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30948 is composite. Its prime factorisation is
- 3
The divisors add up to 72240; without 30948 itself that is 41292, so 30948 is abundant (41292 is more than 30948). Euler's totient φ(30948) = 10312 numbers up to 30948 share no factor with it.
- 4
The digits of 30948 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 178 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30948 = 2^{2} \times 3 \times 2579 \]30948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 72240 |
| Euler totient φ(n) | 10312 |
| Square | 957778704 |
| Cube | 29641335331392 |
| Square root | 175.920437 (= 2√7737) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 178 |
| Scientific notation | 3.0948 × |
30948 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and forty-eight |
| Binary (base 2) | 111100011100100 |
| Octal (base 8) | 74344 |
| Hexadecimal (base 16) | 78E4 |
| Base 3 | 1120110020 |
| As time | 30948 seconds = 8 h 35 min 48 s |
Is 30948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30948 ÷ 2 = 15474) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (30948 ÷ 3 = 10316) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (30948 ÷ 4 = 7737) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (30948 ÷ 6 = 5158) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (30948 ÷ 12 = 2579) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30948 a prime number?
No. 30948 = × 3 × 2579, so it is divisible by 2.
What are the factors of 30948?
1, 2, 3, 4, 6, 12, 2579, 5158, 7737, 10316, 15474, 30948.
What is 30948 in binary?
111100011100100 (hexadecimal 78E4, octal 74344).
What is the square root of 30948?
About 175.9204, exactly 2√7737.
Is 30948 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 30948?
It is a composite number with 12 divisors.