The number 55947
55947 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 1097. Divisors (8): 1, 3, 17, 51, 1097, 3291, 18649, 55947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55947 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55947 is composite. Its prime factorisation is
- 3
The divisors add up to 79056; without 55947 itself that is 23109, so 55947 is deficient (23109 is less than 55947). Euler's totient φ(55947) = 35072 numbers up to 55947 share no factor with it.
- 4
The digits of 55947 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55947 = 3 \times 17 \times 1097 \]
55947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79056 |
| Euler totient φ(n) | 35072 |
| Square | 3130066809 |
| Cube | 175117847763123 |
| Square root | 236.531182 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5947 × |
55947 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and forty-seven |
| Binary (base 2) | 1101101010001011 |
| Octal (base 8) | 155213 |
| Hexadecimal (base 16) | DA8B |
| Base 3 | 2211202010 |
| As time | 55947 seconds = 15 h 32 min 27 s |
Is 55947 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 (55947 ÷ 3 = 18649) | 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 2) | 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 3) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 55947 a prime number?
No. 55947 = 3 × 17 × 1097, so it is divisible by 3.
What are the factors of 55947?
1, 3, 17, 51, 1097, 3291, 18649, 55947.
What is 55947 in binary?
1101101010001011 (hexadecimal DA8B, octal 155213).
What is the square root of 55947?
About 236.5312.
Is 55947 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 55947?
It is a composite number with 8 divisors.