The number 55963
55963 is a composite number with 4 divisors. Its prime factorisation is 191 × 293. Divisors (4): 1, 191, 293, 55963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55963: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 191 × 293, the product of two primes.
- 2
55963 is composite. Its prime factorisation is
- 3
The divisors add up to 56448; without 55963 itself that is 485, so 55963 is deficient (485 is less than 55963). Euler's totient φ(55963) = 55480 numbers up to 55963 share no factor with it.
- 4
The digits of 55963 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55963 = 191 \times 293 \]
55963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56448 |
| Euler totient φ(n) | 55480 |
| Square | 3131857369 |
| Cube | 175268133941347 |
| Square root | 236.565002 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5963 × |
55963 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and sixty-three |
| Binary (base 2) | 1101101010011011 |
| Octal (base 8) | 155233 |
| Hexadecimal (base 16) | DA9B |
| Base 3 | 2211202201 |
| As time | 55963 seconds = 15 h 32 min 43 s |
Is 55963 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 | No (remainder 1) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55963 a prime number?
No. 55963 = 191 × 293, so it is divisible by 191.
What are the factors of 55963?
1, 191, 293, 55963.
What is 55963 in binary?
1101101010011011 (hexadecimal DA9B, octal 155233).
What is the square root of 55963?
About 236.5650.
Is 55963 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 55963?
55963 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 191 × 293, the product of two primes.