The number 55957
55957 is a composite number with 4 divisors. Its prime factorisation is 11 × 5087. Divisors (4): 1, 11, 5087, 55957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55957: a semiprime: 11 × 5087, the product of two primes.
- 2
55957 is composite. Its prime factorisation is
- 3
The divisors add up to 61056; without 55957 itself that is 5099, so 55957 is deficient (5099 is less than 55957). Euler's totient φ(55957) = 50860 numbers up to 55957 share no factor with it.
- 4
The digits of 55957 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
\[ 55957 = 11 \times 5087 \]
55957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61056 |
| Euler totient φ(n) | 50860 |
| Square | 3131185849 |
| Cube | 175211766552493 |
| Square root | 236.552320 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5957 × |
55957 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and fifty-seven |
| Binary (base 2) | 1101101010010101 |
| Octal (base 8) | 155225 |
| Hexadecimal (base 16) | DA95 |
| Base 3 | 2211202111 |
| As time | 55957 seconds = 15 h 32 min 37 s |
Is 55957 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 | No (remainder 1) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55957 ÷ 11 = 5087) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55957 a prime number?
No. 55957 = 11 × 5087, so it is divisible by 11.
What are the factors of 55957?
1, 11, 5087, 55957.
What is 55957 in binary?
1101101010010101 (hexadecimal DA95, octal 155225).
What is the square root of 55957?
About 236.5523.
Is 55957 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 55957?
55957 is a semiprime: 11 × 5087, the product of two primes.