The number 10635
10635 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 709. Divisors (8): 1, 3, 5, 15, 709, 2127, 3545, 10635.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10635: a Harshad number: divisible by its digit sum 15.
- 2
10635 is composite. Its prime factorisation is
- 3
The divisors add up to 17040; without 10635 itself that is 6405, so 10635 is deficient (6405 is less than 10635). Euler's totient φ(10635) = 5664 numbers up to 10635 share no factor with it.
- 4
The digits of 10635 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10635 = 3 \times 5 \times 709 \]
10635 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17040 |
| Euler totient φ(n) | 5664 |
| Square | 113103225 |
| Cube | 1202852797875 |
| Square root | 103.126136 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0635 × |
10635 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and thirty-five |
| Binary (base 2) | 10100110001011 |
| Octal (base 8) | 24613 |
| Hexadecimal (base 16) | 298B |
| Base 3 | 112120220 |
| As time | 10635 seconds = 2 h 57 min 15 s |
Is 10635 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10635 ÷ 3 = 3545) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10635 ÷ 5 = 2127) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10635 a prime number?
No. 10635 = 3 × 5 × 709, so it is divisible by 3.
What are the factors of 10635?
1, 3, 5, 15, 709, 2127, 3545, 10635.
What is 10635 in binary?
10100110001011 (hexadecimal 298B, octal 24613).
What is the square root of 10635?
About 103.1261.
Is 10635 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 10635?
10635 is a Harshad number: divisible by its digit sum 15.