The number 56322
56322 is a composite number with 32 divisors. Its prime factorisation is 2 × × 7 × 149. Divisors (32): 1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 42, 54, 63, 126, 149, 189 … 56322.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56322: a Harshad number: divisible by its digit sum 18.
- 2
56322 is composite. Its prime factorisation is
- 3
The divisors add up to 144000; without 56322 itself that is 87678, so 56322 is abundant (87678 is more than 56322). Euler's totient φ(56322) = 15984 numbers up to 56322 share no factor with it.
- 4
The digits of 56322 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56322 = 2 \times 3^{3} \times 7 \times 149 \]56322 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 144000 |
| Euler totient φ(n) | 15984 |
| Square | 3172167684 |
| Cube | 178662828298248 |
| Square root | 237.322565 (= 3√6258) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.6322 × |
56322 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand three hundred and twenty-two |
| Binary (base 2) | 1101110000000010 |
| Octal (base 8) | 156002 |
| Hexadecimal (base 16) | DC02 |
| Base 3 | 2212021000 |
| As time | 56322 seconds = 15 h 38 min 42 s |
Is 56322 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56322 ÷ 2 = 28161) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56322 ÷ 3 = 18774) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (56322 ÷ 6 = 9387) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (56322 ÷ 7 = 8046) | 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 | Yes (56322 ÷ 9 = 6258) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56322 a prime number?
No. 56322 = 2 × × 7 × 149, so it is divisible by 2.
What are the factors of 56322?
1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 42, 54, 63, 126, 149, 189, 298, 378, 447, 894, 1043, 1341, 2086, 2682, 3129, 4023, 6258, 8046, 9387, 18774, 28161, 56322.
What is 56322 in binary?
1101110000000010 (hexadecimal DC02, octal 156002).
What is the square root of 56322?
About 237.3226, exactly 3√6258.
Is 56322 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 56322?
56322 is a Harshad number: divisible by its digit sum 18.