The number 55946
55946 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 2543. Divisors (8): 1, 2, 11, 22, 2543, 5086, 27973, 55946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55946 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55946 is composite. Its prime factorisation is
- 3
The divisors add up to 91584; without 55946 itself that is 35638, so 55946 is deficient (35638 is less than 55946). Euler's totient φ(55946) = 25420 numbers up to 55946 share no factor with it.
- 4
The digits of 55946 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55946 = 2 \times 11 \times 2543 \]
55946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91584 |
| Euler totient φ(n) | 25420 |
| Square | 3129954916 |
| Cube | 175108457730536 |
| Square root | 236.529068 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5946 × |
55946 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and forty-six |
| Binary (base 2) | 1101101010001010 |
| Octal (base 8) | 155212 |
| Hexadecimal (base 16) | DA8A |
| Base 3 | 2211202002 |
| As time | 55946 seconds = 15 h 32 min 26 s |
Is 55946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55946 ÷ 2 = 27973) | 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 | No (remainder 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55946 ÷ 11 = 5086) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55946 a prime number?
No. 55946 = 2 × 11 × 2543, so it is divisible by 2.
What are the factors of 55946?
1, 2, 11, 22, 2543, 5086, 27973, 55946.
What is 55946 in binary?
1101101010001010 (hexadecimal DA8A, octal 155212).
What is the square root of 55946?
About 236.5291.
Is 55946 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 55946?
It is a composite number with 8 divisors.