The number 55693
55693 is a composite number with 8 divisors. Its prime factorisation is 11 × 61 × 83. Divisors (8): 1, 11, 61, 83, 671, 913, 5063, 55693.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55693: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55693 is composite. Its prime factorisation is
- 3
The divisors add up to 62496; without 55693 itself that is 6803, so 55693 is deficient (6803 is less than 55693). Euler's totient φ(55693) = 49200 numbers up to 55693 share no factor with it.
- 4
The digits of 55693 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55693 = 11 \times 61 \times 83 \]
55693 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62496 |
| Euler totient φ(n) | 49200 |
| Square | 3101710249 |
| Cube | 172743548897557 |
| Square root | 235.993644 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5693 × |
55693 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand six hundred and ninety-three |
| Binary (base 2) | 1101100110001101 |
| Octal (base 8) | 154615 |
| Hexadecimal (base 16) | D98D |
| Base 3 | 2211101201 |
| As time | 55693 seconds = 15 h 28 min 13 s |
Is 55693 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 1) | 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 5) | 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 | Yes (55693 ÷ 11 = 5063) | 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 55693 a prime number?
No. 55693 = 11 × 61 × 83, so it is divisible by 11.
What are the factors of 55693?
1, 11, 61, 83, 671, 913, 5063, 55693.
What is 55693 in binary?
1101100110001101 (hexadecimal D98D, octal 154615).
What is the square root of 55693?
About 235.9936.
Is 55693 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 55693?
55693 is a happy number: repeatedly adding the squares of its digits reaches 1.