The number 55948
55948 is a composite number with 12 divisors. Its prime factorisation is × 71 × 197. Divisors (12): 1, 2, 4, 71, 142, 197, 284, 394, 788, 13987, 27974, 55948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55948 is composite. Its prime factorisation is
- 3
The divisors add up to 99792; without 55948 itself that is 43844, so 55948 is deficient (43844 is less than 55948). Euler's totient φ(55948) = 27440 numbers up to 55948 share no factor with it.
- 4
The digits of 55948 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55948 = 2^{2} \times 71 \times 197 \]55948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 99792 |
| Euler totient φ(n) | 27440 |
| Square | 3130178704 |
| Cube | 175127238131392 |
| Square root | 236.533296 (= 2√13987) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5948 × |
55948 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and forty-eight |
| Binary (base 2) | 1101101010001100 |
| Octal (base 8) | 155214 |
| Hexadecimal (base 16) | DA8C |
| Base 3 | 2211202011 |
| As time | 55948 seconds = 15 h 32 min 28 s |
Is 55948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55948 ÷ 2 = 27974) | 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 (55948 ÷ 4 = 13987) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | 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 2) | 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 55948 a prime number?
No. 55948 = × 71 × 197, so it is divisible by 2.
What are the factors of 55948?
1, 2, 4, 71, 142, 197, 284, 394, 788, 13987, 27974, 55948.
What is 55948 in binary?
1101101010001100 (hexadecimal DA8C, octal 155214).
What is the square root of 55948?
About 236.5333, exactly 2√13987.
Is 55948 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 55948?
It is a composite number with 12 divisors.