The number 56948
56948 is a composite number with 12 divisors. Its prime factorisation is × 23 × 619. Divisors (12): 1, 2, 4, 23, 46, 92, 619, 1238, 2476, 14237, 28474, 56948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56948 is composite. Its prime factorisation is
- 3
The divisors add up to 104160; without 56948 itself that is 47212, so 56948 is deficient (47212 is less than 56948). Euler's totient φ(56948) = 27192 numbers up to 56948 share no factor with it.
- 4
The digits of 56948 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56948 = 2^{2} \times 23 \times 619 \]56948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 104160 |
| Euler totient φ(n) | 27192 |
| Square | 3243074704 |
| Cube | 184686618243392 |
| Square root | 238.637801 (= 2√14237) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.6948 × |
56948 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and forty-eight |
| Binary (base 2) | 1101111001110100 |
| Octal (base 8) | 157164 |
| Hexadecimal (base 16) | DE74 |
| Base 3 | 2220010012 |
| As time | 56948 seconds = 15 h 49 min 8 s |
Is 56948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56948 ÷ 2 = 28474) | 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 (56948 ÷ 4 = 14237) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | 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 1) | 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 56948 a prime number?
No. 56948 = × 23 × 619, so it is divisible by 2.
What are the factors of 56948?
1, 2, 4, 23, 46, 92, 619, 1238, 2476, 14237, 28474, 56948.
What is 56948 in binary?
1101111001110100 (hexadecimal DE74, octal 157164).
What is the square root of 56948?
About 238.6378, exactly 2√14237.
Is 56948 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 56948?
It is a composite number with 12 divisors.