The number 10370
10370 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 17 × 61. Divisors (16): 1, 2, 5, 10, 17, 34, 61, 85, 122, 170, 305, 610, 1037, 2074, 5185, 10370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10370 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10370 is composite. Its prime factorisation is
- 3
The divisors add up to 20088; without 10370 itself that is 9718, so 10370 is deficient (9718 is less than 10370). Euler's totient φ(10370) = 3840 numbers up to 10370 share no factor with it.
- 4
The digits of 10370 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10370 = 2 \times 5 \times 17 \times 61 \]
10370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 20088 |
| Euler totient φ(n) | 3840 |
| Square | 107536900 |
| Cube | 1115157653000 |
| Square root | 101.833197 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.037 × |
10370 in other forms
| Form | Value |
|---|---|
| In words | ten thousand three hundred and seventy |
| Binary (base 2) | 10100010000010 |
| Octal (base 8) | 24202 |
| Hexadecimal (base 16) | 2882 |
| Base 3 | 112020002 |
| As time | 10370 seconds = 2 h 52 min 50 s |
Is 10370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10370 ÷ 2 = 5185) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (10370 ÷ 5 = 2074) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10370 ÷ 10 = 1037) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10370 a prime number?
No. 10370 = 2 × 5 × 17 × 61, so it is divisible by 2.
What are the factors of 10370?
1, 2, 5, 10, 17, 34, 61, 85, 122, 170, 305, 610, 1037, 2074, 5185, 10370.
What is 10370 in binary?
10100010000010 (hexadecimal 2882, octal 24202).
What is the square root of 10370?
About 101.8332.
Is 10370 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 10370?
It is a composite number with 16 divisors.