The number 55983
55983 is a composite number with 4 divisors. Its prime factorisation is 3 × 18661. Divisors (4): 1, 3, 18661, 55983.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55983: a semiprime: 3 × 18661, the product of two primes.
- 2
55983 is composite. Its prime factorisation is
- 3
The divisors add up to 74648; without 55983 itself that is 18665, so 55983 is deficient (18665 is less than 55983). Euler's totient φ(55983) = 37320 numbers up to 55983 share no factor with it.
- 4
The digits of 55983 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55983 = 3 \times 18661 \]
55983 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 74648 |
| Euler totient φ(n) | 37320 |
| Square | 3134096289 |
| Cube | 175456112547087 |
| Square root | 236.607270 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.5983 × |
55983 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and eighty-three |
| Binary (base 2) | 1101101010101111 |
| Octal (base 8) | 155257 |
| Hexadecimal (base 16) | DAAF |
| Base 3 | 2211210110 |
| As time | 55983 seconds = 15 h 33 min 3 s |
Is 55983 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 (55983 ÷ 3 = 18661) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55983 a prime number?
No. 55983 = 3 × 18661, so it is divisible by 3.
What are the factors of 55983?
1, 3, 18661, 55983.
What is 55983 in binary?
1101101010101111 (hexadecimal DAAF, octal 155257).
What is the square root of 55983?
About 236.6073.
Is 55983 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 55983?
55983 is a semiprime: 3 × 18661, the product of two primes.