The number 12370
12370 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1237. Divisors (8): 1, 2, 5, 10, 1237, 2474, 6185, 12370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12370 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12370 is composite. Its prime factorisation is
- 3
The divisors add up to 22284; without 12370 itself that is 9914, so 12370 is deficient (9914 is less than 12370). Euler's totient φ(12370) = 4944 numbers up to 12370 share no factor with it.
- 4
The digits of 12370 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12370 = 2 \times 5 \times 1237 \]
12370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22284 |
| Euler totient φ(n) | 4944 |
| Square | 153016900 |
| Cube | 1892819053000 |
| Square root | 111.220502 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.237 × |
12370 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand three hundred and seventy |
| Binary (base 2) | 11000001010010 |
| Octal (base 8) | 30122 |
| Hexadecimal (base 16) | 3052 |
| Base 3 | 121222011 |
| As time | 12370 seconds = 3 h 26 min 10 s |
Is 12370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12370 ÷ 2 = 6185) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12370 ÷ 5 = 2474) | 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 1) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (12370 ÷ 10 = 1237) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12370 a prime number?
No. 12370 = 2 × 5 × 1237, so it is divisible by 2.
What are the factors of 12370?
1, 2, 5, 10, 1237, 2474, 6185, 12370.
What is 12370 in binary?
11000001010010 (hexadecimal 3052, octal 30122).
What is the square root of 12370?
About 111.2205.
Is 12370 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 12370?
It is a composite number with 8 divisors.