The number 56668
56668 is a composite number with 12 divisors. Its prime factorisation is × 31 × 457. Divisors (12): 1, 2, 4, 31, 62, 124, 457, 914, 1828, 14167, 28334, 56668.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56668: a Harshad number: divisible by its digit sum 31.
- 2
56668 is composite. Its prime factorisation is
- 3
The divisors add up to 102592; without 56668 itself that is 45924, so 56668 is deficient (45924 is less than 56668). Euler's totient φ(56668) = 27360 numbers up to 56668 share no factor with it.
- 4
The digits of 56668 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56668 = 2^{2} \times 31 \times 457 \]56668 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 102592 |
| Euler totient φ(n) | 27360 |
| Square | 3211262224 |
| Cube | 181975807709632 |
| Square root | 238.050415 (= 2√14167) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6668 × |
56668 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand six hundred and sixty-eight |
| Binary (base 2) | 1101110101011100 |
| Octal (base 8) | 156534 |
| Hexadecimal (base 16) | DD5C |
| Base 3 | 2212201211 |
| As time | 56668 seconds = 15 h 44 min 28 s |
Is 56668 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56668 ÷ 2 = 28334) | 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 | Yes (56668 ÷ 4 = 14167) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56668 a prime number?
No. 56668 = × 31 × 457, so it is divisible by 2.
What are the factors of 56668?
1, 2, 4, 31, 62, 124, 457, 914, 1828, 14167, 28334, 56668.
What is 56668 in binary?
1101110101011100 (hexadecimal DD5C, octal 156534).
What is the square root of 56668?
About 238.0504, exactly 2√14167.
Is 56668 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 56668?
56668 is a Harshad number: divisible by its digit sum 31.