The number 11970
11970 is a composite number with 48 divisors. Its prime factorisation is 2 × × 5 × 7 × 19. Divisors (48): 1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 19, 21, 30, 35, 38 … 11970.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11970: a Harshad number: divisible by its digit sum 18.
- 2
11970 is composite. Its prime factorisation is
- 3
The divisors add up to 37440; without 11970 itself that is 25470, so 11970 is abundant (25470 is more than 11970). Euler's totient φ(11970) = 2592 numbers up to 11970 share no factor with it.
- 4
The digits of 11970 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 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11970 = 2 \times 3^{2} \times 5 \times 7 \times 19 \]11970 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 37440 |
| Euler totient φ(n) | 2592 |
| Square | 143280900 |
| Cube | 1715072373000 |
| Square root | 109.407495 (= 3√1330) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.197 × |
11970 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and seventy |
| Binary (base 2) | 10111011000010 |
| Octal (base 8) | 27302 |
| Hexadecimal (base 16) | 2EC2 |
| Base 3 | 121102100 |
| As time | 11970 seconds = 3 h 19 min 30 s |
Is 11970 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11970 ÷ 2 = 5985) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11970 ÷ 3 = 3990) | 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 (11970 ÷ 5 = 2394) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11970 ÷ 6 = 1995) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (11970 ÷ 7 = 1710) | 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 (11970 ÷ 9 = 1330) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11970 ÷ 10 = 1197) | 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 11970 a prime number?
No. 11970 = 2 × × 5 × 7 × 19, so it is divisible by 2.
What are the factors of 11970?
1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 19, 21, 30, 35, 38, 42, 45, 57, 63, 70, 90, 95, 105, 114, 126, 133, 171, 190, 210, 266, 285, 315, 342, 399, 570, 630, 665, 798, 855, 1197, 1330, 1710, 1995, 2394, 3990, 5985, 11970.
What is 11970 in binary?
10111011000010 (hexadecimal 2EC2, octal 27302).
What is the square root of 11970?
About 109.4075, exactly 3√1330.
Is 11970 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 11970?
11970 is a Harshad number: divisible by its digit sum 18.