The number 55959
55959 is a composite number with 8 divisors. Its prime factorisation is 3 × 23 × 811. Divisors (8): 1, 3, 23, 69, 811, 2433, 18653, 55959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55959 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55959 is composite. Its prime factorisation is
- 3
The divisors add up to 77952; without 55959 itself that is 21993, so 55959 is deficient (21993 is less than 55959). Euler's totient φ(55959) = 35640 numbers up to 55959 share no factor with it.
- 4
The digits of 55959 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55959 = 3 \times 23 \times 811 \]
55959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77952 |
| Euler totient φ(n) | 35640 |
| Square | 3131409681 |
| Cube | 175230554339079 |
| Square root | 236.556547 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5959 × |
55959 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and fifty-nine |
| Binary (base 2) | 1101101010010111 |
| Octal (base 8) | 155227 |
| Hexadecimal (base 16) | DA97 |
| Base 3 | 2211202120 |
| As time | 55959 seconds = 15 h 32 min 39 s |
Is 55959 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 (55959 ÷ 3 = 18653) | 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 4) | 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 1) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 55959 a prime number?
No. 55959 = 3 × 23 × 811, so it is divisible by 3.
What are the factors of 55959?
1, 3, 23, 69, 811, 2433, 18653, 55959.
What is 55959 in binary?
1101101010010111 (hexadecimal DA97, octal 155227).
What is the square root of 55959?
About 236.5565.
Is 55959 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 55959?
It is a composite number with 8 divisors.