The number 56970
56970 is a composite number with 32 divisors. Its prime factorisation is 2 × × 5 × 211. Divisors (32): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 211 … 56970.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56970: a Harshad number: divisible by its digit sum 27.
- 2
56970 is composite. Its prime factorisation is
- 3
The divisors add up to 152640; without 56970 itself that is 95670, so 56970 is abundant (95670 is more than 56970). Euler's totient φ(56970) = 15120 numbers up to 56970 share no factor with it.
- 4
The digits of 56970 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56970 = 2 \times 3^{3} \times 5 \times 211 \]56970 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 152640 |
| Euler totient φ(n) | 15120 |
| Square | 3245580900 |
| Cube | 184900743873000 |
| Square root | 238.683891 (= 3√6330) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.697 × |
56970 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and seventy |
| Binary (base 2) | 1101111010001010 |
| Octal (base 8) | 157212 |
| Hexadecimal (base 16) | DE8A |
| Base 3 | 2220011000 |
| As time | 56970 seconds = 15 h 49 min 30 s |
Is 56970 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56970 ÷ 2 = 28485) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56970 ÷ 3 = 18990) | 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 (56970 ÷ 5 = 11394) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (56970 ÷ 6 = 9495) | 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 | Yes (56970 ÷ 9 = 6330) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (56970 ÷ 10 = 5697) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 56970 a prime number?
No. 56970 = 2 × × 5 × 211, so it is divisible by 2.
What are the factors of 56970?
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 211, 270, 422, 633, 1055, 1266, 1899, 2110, 3165, 3798, 5697, 6330, 9495, 11394, 18990, 28485, 56970.
What is 56970 in binary?
1101111010001010 (hexadecimal DE8A, octal 157212).
What is the square root of 56970?
About 238.6839, exactly 3√6330.
Is 56970 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56970?
56970 is a Harshad number: divisible by its digit sum 27.