The number 11370
11370 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 379. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 379, 758, 1137, 1895, 2274, 3790, 5685, 11370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11370 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11370 is composite. Its prime factorisation is
- 3
The divisors add up to 27360; without 11370 itself that is 15990, so 11370 is abundant (15990 is more than 11370). Euler's totient φ(11370) = 3024 numbers up to 11370 share no factor with it.
- 4
The digits of 11370 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11370 = 2 \times 3 \times 5 \times 379 \]
11370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 27360 |
| Euler totient φ(n) | 3024 |
| Square | 129276900 |
| Cube | 1469878353000 |
| Square root | 106.630202 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.137 × |
11370 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and seventy |
| Binary (base 2) | 10110001101010 |
| Octal (base 8) | 26152 |
| Hexadecimal (base 16) | 2C6A |
| Base 3 | 120121010 |
| As time | 11370 seconds = 3 h 9 min 30 s |
Is 11370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11370 ÷ 2 = 5685) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11370 ÷ 3 = 3790) | 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 (11370 ÷ 5 = 2274) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11370 ÷ 6 = 1895) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11370 ÷ 10 = 1137) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11370 a prime number?
No. 11370 = 2 × 3 × 5 × 379, so it is divisible by 2.
What are the factors of 11370?
1, 2, 3, 5, 6, 10, 15, 30, 379, 758, 1137, 1895, 2274, 3790, 5685, 11370.
What is 11370 in binary?
10110001101010 (hexadecimal 2C6A, octal 26152).
What is the square root of 11370?
About 106.6302.
Is 11370 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11370?
It is a composite number with 16 divisors.