The number 10290
10290 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × . Divisors (32): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 49, 70, 98 … 10290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10290: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
10290 is composite. Its prime factorisation is
- 3
The divisors add up to 28800; without 10290 itself that is 18510, so 10290 is abundant (18510 is more than 10290). Euler's totient φ(10290) = 2352 numbers up to 10290 share no factor with it.
- 4
The digits of 10290 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10290 = 2 \times 3 \times 5 \times 7^{3} \]10290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 28800 |
| Euler totient φ(n) | 2352 |
| Square | 105884100 |
| Cube | 1089547389000 |
| Square root | 101.439637 (= 7√210) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.029 × |
10290 in other forms
| Form | Value |
|---|---|
| In words | ten thousand two hundred and ninety |
| Binary (base 2) | 10100000110010 |
| Octal (base 8) | 24062 |
| Hexadecimal (base 16) | 2832 |
| Base 3 | 112010010 |
| As time | 10290 seconds = 2 h 51 min 30 s |
Is 10290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10290 ÷ 2 = 5145) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10290 ÷ 3 = 3430) | 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 (10290 ÷ 5 = 2058) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (10290 ÷ 6 = 1715) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (10290 ÷ 7 = 1470) | 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 (10290 ÷ 10 = 1029) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 10290 a prime number?
No. 10290 = 2 × 3 × 5 × , so it is divisible by 2.
What are the factors of 10290?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 49, 70, 98, 105, 147, 210, 245, 294, 343, 490, 686, 735, 1029, 1470, 1715, 2058, 3430, 5145, 10290.
What is 10290 in binary?
10100000110010 (hexadecimal 2832, octal 24062).
What is the square root of 10290?
About 101.4396, exactly 7√210.
Is 10290 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 10290?
10290 is a happy number: repeatedly adding the squares of its digits reaches 1.