The number 10390
10390 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1039. Divisors (8): 1, 2, 5, 10, 1039, 2078, 5195, 10390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10390: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
10390 is composite. Its prime factorisation is
- 3
The divisors add up to 18720; without 10390 itself that is 8330, so 10390 is deficient (8330 is less than 10390). Euler's totient φ(10390) = 4152 numbers up to 10390 share no factor with it.
- 4
The digits of 10390 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 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10390 = 2 \times 5 \times 1039 \]
10390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18720 |
| Euler totient φ(n) | 4152 |
| Square | 107952100 |
| Cube | 1121622319000 |
| Square root | 101.931349 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 104 |
| Scientific notation | 1.039 × |
10390 in other forms
| Form | Value |
|---|---|
| In words | ten thousand three hundred and ninety |
| Binary (base 2) | 10100010010110 |
| Octal (base 8) | 24226 |
| Hexadecimal (base 16) | 2896 |
| Base 3 | 112020211 |
| As time | 10390 seconds = 2 h 53 min 10 s |
Is 10390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10390 ÷ 2 = 5195) | 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 (10390 ÷ 5 = 2078) | 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 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 6) | 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 (10390 ÷ 10 = 1039) | 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 10390 a prime number?
No. 10390 = 2 × 5 × 1039, so it is divisible by 2.
What are the factors of 10390?
1, 2, 5, 10, 1039, 2078, 5195, 10390.
What is 10390 in binary?
10100010010110 (hexadecimal 2896, octal 24226).
What is the square root of 10390?
About 101.9313.
Is 10390 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 10390?
10390 is a happy number: repeatedly adding the squares of its digits reaches 1.