The number 55941
55941 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 643. Divisors (8): 1, 3, 29, 87, 643, 1929, 18647, 55941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55941 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55941 is composite. Its prime factorisation is
- 3
The divisors add up to 77280; without 55941 itself that is 21339, so 55941 is deficient (21339 is less than 55941). Euler's totient φ(55941) = 35952 numbers up to 55941 share no factor with it.
- 4
The digits of 55941 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55941 = 3 \times 29 \times 643 \]
55941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77280 |
| Euler totient φ(n) | 35952 |
| Square | 3129395481 |
| Cube | 175061512602621 |
| Square root | 236.518498 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5941 × |
55941 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and forty-one |
| Binary (base 2) | 1101101010000101 |
| Octal (base 8) | 155205 |
| Hexadecimal (base 16) | DA85 |
| Base 3 | 2211201220 |
| As time | 55941 seconds = 15 h 32 min 21 s |
Is 55941 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55941 ÷ 3 = 18647) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55941 a prime number?
No. 55941 = 3 × 29 × 643, so it is divisible by 3.
What are the factors of 55941?
1, 3, 29, 87, 643, 1929, 18647, 55941.
What is 55941 in binary?
1101101010000101 (hexadecimal DA85, octal 155205).
What is the square root of 55941?
About 236.5185.
Is 55941 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 55941?
It is a composite number with 8 divisors.