The number 55956
55956 is a composite number with 12 divisors. Its prime factorisation is × 3 × 4663. Divisors (12): 1, 2, 3, 4, 6, 12, 4663, 9326, 13989, 18652, 27978, 55956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55956: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55956 is composite. Its prime factorisation is
- 3
The divisors add up to 130592; without 55956 itself that is 74636, so 55956 is abundant (74636 is more than 55956). Euler's totient φ(55956) = 18648 numbers up to 55956 share no factor with it.
- 4
The digits of 55956 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55956 = 2^{2} \times 3 \times 4663 \]55956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 130592 |
| Euler totient φ(n) | 18648 |
| Square | 3131073936 |
| Cube | 175202373162816 |
| Square root | 236.550206 (= 2√13989) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5956 × |
55956 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and fifty-six |
| Binary (base 2) | 1101101010010100 |
| Octal (base 8) | 155224 |
| Hexadecimal (base 16) | DA94 |
| Base 3 | 2211202110 |
| As time | 55956 seconds = 15 h 32 min 36 s |
Is 55956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55956 ÷ 2 = 27978) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55956 ÷ 3 = 18652) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (55956 ÷ 4 = 13989) | 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 | Yes (55956 ÷ 6 = 9326) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (55956 ÷ 12 = 4663) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55956 a prime number?
No. 55956 = × 3 × 4663, so it is divisible by 2.
What are the factors of 55956?
1, 2, 3, 4, 6, 12, 4663, 9326, 13989, 18652, 27978, 55956.
What is 55956 in binary?
1101101010010100 (hexadecimal DA94, octal 155224).
What is the square root of 55956?
About 236.5502, exactly 2√13989.
Is 55956 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 55956?
55956 is a happy number: repeatedly adding the squares of its digits reaches 1.