The number 55940
55940 is a composite number with 12 divisors. Its prime factorisation is × 5 × 2797. Divisors (12): 1, 2, 4, 5, 10, 20, 2797, 5594, 11188, 13985, 27970, 55940.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55940 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55940 is composite. Its prime factorisation is
- 3
The divisors add up to 117516; without 55940 itself that is 61576, so 55940 is abundant (61576 is more than 55940). Euler's totient φ(55940) = 22368 numbers up to 55940 share no factor with it.
- 4
The digits of 55940 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55940 = 2^{2} \times 5 \times 2797 \]55940 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 117516 |
| Euler totient φ(n) | 22368 |
| Square | 3129283600 |
| Cube | 175052124584000 |
| Square root | 236.516384 (= 2√13985) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.594 × |
55940 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and forty |
| Binary (base 2) | 1101101010000100 |
| Octal (base 8) | 155204 |
| Hexadecimal (base 16) | DA84 |
| Base 3 | 2211201212 |
| As time | 55940 seconds = 15 h 32 min 20 s |
Is 55940 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55940 ÷ 2 = 27970) | 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 (55940 ÷ 4 = 13985) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (55940 ÷ 5 = 11188) | 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 | Yes (55940 ÷ 10 = 5594) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55940 a prime number?
No. 55940 = × 5 × 2797, so it is divisible by 2.
What are the factors of 55940?
1, 2, 4, 5, 10, 20, 2797, 5594, 11188, 13985, 27970, 55940.
What is 55940 in binary?
1101101010000100 (hexadecimal DA84, octal 155204).
What is the square root of 55940?
About 236.5164, exactly 2√13985.
Is 55940 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55940?
It is a composite number with 12 divisors.