The number 55953
55953 is a composite number with 6 divisors. Its prime factorisation is × 6217. Divisors (6): 1, 3, 9, 6217, 18651, 55953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55953 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55953 is composite. Its prime factorisation is
- 3
The divisors add up to 80834; without 55953 itself that is 24881, so 55953 is deficient (24881 is less than 55953). Euler's totient φ(55953) = 37296 numbers up to 55953 share no factor with it.
- 4
The digits of 55953 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55953 = 3^{2} \times 6217 \]55953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 80834 |
| Euler totient φ(n) | 37296 |
| Square | 3130738209 |
| Cube | 175174195008177 |
| Square root | 236.543865 (= 3√6217) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5953 × |
55953 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and fifty-three |
| Binary (base 2) | 1101101010010001 |
| Octal (base 8) | 155221 |
| Hexadecimal (base 16) | DA91 |
| Base 3 | 2211202100 |
| As time | 55953 seconds = 15 h 32 min 33 s |
Is 55953 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 (55953 ÷ 3 = 18651) | 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 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 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (55953 ÷ 9 = 6217) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55953 a prime number?
No. 55953 = × 6217, so it is divisible by 3.
What are the factors of 55953?
1, 3, 9, 6217, 18651, 55953.
What is 55953 in binary?
1101101010010001 (hexadecimal DA91, octal 155221).
What is the square root of 55953?
About 236.5439, exactly 3√6217.
Is 55953 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 55953?
It is a composite number with 6 divisors.