The number 55690
55690 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5569. Divisors (8): 1, 2, 5, 10, 5569, 11138, 27845, 55690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55690: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55690 is composite. Its prime factorisation is
- 3
The divisors add up to 100260; without 55690 itself that is 44570, so 55690 is deficient (44570 is less than 55690). Euler's totient φ(55690) = 22272 numbers up to 55690 share no factor with it.
- 4
The digits of 55690 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55690 = 2 \times 5 \times 5569 \]
55690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 100260 |
| Euler totient φ(n) | 22272 |
| Square | 3101376100 |
| Cube | 172715635009000 |
| Square root | 235.987288 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.569 × |
55690 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand six hundred and ninety |
| Binary (base 2) | 1101100110001010 |
| Octal (base 8) | 154612 |
| Hexadecimal (base 16) | D98A |
| Base 3 | 2211101121 |
| As time | 55690 seconds = 15 h 28 min 10 s |
Is 55690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55690 ÷ 2 = 27845) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (55690 ÷ 5 = 11138) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | 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 | Yes (55690 ÷ 10 = 5569) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55690 a prime number?
No. 55690 = 2 × 5 × 5569, so it is divisible by 2.
What are the factors of 55690?
1, 2, 5, 10, 5569, 11138, 27845, 55690.
What is 55690 in binary?
1101100110001010 (hexadecimal D98A, octal 154612).
What is the square root of 55690?
About 235.9873.
Is 55690 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55690?
55690 is a happy number: repeatedly adding the squares of its digits reaches 1.