The number 56690
56690 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5669. Divisors (8): 1, 2, 5, 10, 5669, 11338, 28345, 56690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56690 is composite. Its prime factorisation is
- 3
The divisors add up to 102060; without 56690 itself that is 45370, so 56690 is deficient (45370 is less than 56690). Euler's totient φ(56690) = 22672 numbers up to 56690 share no factor with it.
- 4
The digits of 56690 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56690 = 2 \times 5 \times 5669 \]
56690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102060 |
| Euler totient φ(n) | 22672 |
| Square | 3213756100 |
| Cube | 182187833309000 |
| Square root | 238.096619 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.669 × |
56690 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand six hundred and ninety |
| Binary (base 2) | 1101110101110010 |
| Octal (base 8) | 156562 |
| Hexadecimal (base 16) | DD72 |
| Base 3 | 2212202122 |
| As time | 56690 seconds = 15 h 44 min 50 s |
Is 56690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56690 ÷ 2 = 28345) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (56690 ÷ 5 = 11338) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (56690 ÷ 10 = 5669) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56690 a prime number?
No. 56690 = 2 × 5 × 5669, so it is divisible by 2.
What are the factors of 56690?
1, 2, 5, 10, 5669, 11338, 28345, 56690.
What is 56690 in binary?
1101110101110010 (hexadecimal DD72, octal 156562).
What is the square root of 56690?
About 238.0966.
Is 56690 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 56690?
It is a composite number with 8 divisors.