The number 10330
10330 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1033. Divisors (8): 1, 2, 5, 10, 1033, 2066, 5165, 10330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10330: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
10330 is composite. Its prime factorisation is
- 3
The divisors add up to 18612; without 10330 itself that is 8282, so 10330 is deficient (8282 is less than 10330). Euler's totient φ(10330) = 4128 numbers up to 10330 share no factor with it.
- 4
The digits of 10330 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10330 = 2 \times 5 \times 1033 \]
10330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18612 |
| Euler totient φ(n) | 4128 |
| Square | 106708900 |
| Cube | 1102302937000 |
| Square root | 101.636608 |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.033 × |
10330 in other forms
| Form | Value |
|---|---|
| In words | ten thousand three hundred and thirty |
| Binary (base 2) | 10100001011010 |
| Octal (base 8) | 24132 |
| Hexadecimal (base 16) | 285A |
| Base 3 | 112011121 |
| As time | 10330 seconds = 2 h 52 min 10 s |
Is 10330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10330 ÷ 2 = 5165) | 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 (10330 ÷ 5 = 2066) | 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 5) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10330 ÷ 10 = 1033) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 10330 a prime number?
No. 10330 = 2 × 5 × 1033, so it is divisible by 2.
What are the factors of 10330?
1, 2, 5, 10, 1033, 2066, 5165, 10330.
What is 10330 in binary?
10100001011010 (hexadecimal 285A, octal 24132).
What is the square root of 10330?
About 101.6366.
Is 10330 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 10330?
10330 is a happy number: repeatedly adding the squares of its digits reaches 1.