The number 55753
55753 is a composite number with 4 divisors. Its prime factorisation is 127 × 439. Divisors (4): 1, 127, 439, 55753.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55753: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 127 × 439, the product of two primes.
- 2
55753 is composite. Its prime factorisation is
- 3
The divisors add up to 56320; without 55753 itself that is 567, so 55753 is deficient (567 is less than 55753). Euler's totient φ(55753) = 55188 numbers up to 55753 share no factor with it.
- 4
The digits of 55753 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55753 = 127 \times 439 \]
55753 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56320 |
| Euler totient φ(n) | 55188 |
| Square | 3108397009 |
| Cube | 173302458442777 |
| Square root | 236.120732 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5753 × |
55753 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand seven hundred and fifty-three |
| Binary (base 2) | 1101100111001001 |
| Octal (base 8) | 154711 |
| Hexadecimal (base 16) | D9C9 |
| Base 3 | 2211110221 |
| As time | 55753 seconds = 15 h 29 min 13 s |
Is 55753 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 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55753 a prime number?
No. 55753 = 127 × 439, so it is divisible by 127.
What are the factors of 55753?
1, 127, 439, 55753.
What is 55753 in binary?
1101100111001001 (hexadecimal D9C9, octal 154711).
What is the square root of 55753?
About 236.1207.
Is 55753 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55753?
55753 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 127 × 439, the product of two primes.