The number 10905
10905 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 727. Divisors (8): 1, 3, 5, 15, 727, 2181, 3635, 10905.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10905: a Harshad number: divisible by its digit sum 15.
- 2
10905 is composite. Its prime factorisation is
- 3
The divisors add up to 17472; without 10905 itself that is 6567, so 10905 is deficient (6567 is less than 10905). Euler's totient φ(10905) = 5808 numbers up to 10905 share no factor with it.
- 4
The digits of 10905 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 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10905 = 3 \times 5 \times 727 \]
10905 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17472 |
| Euler totient φ(n) | 5808 |
| Square | 118919025 |
| Cube | 1296811967625 |
| Square root | 104.427008 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.0905 × |
10905 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and five |
| Binary (base 2) | 10101010011001 |
| Octal (base 8) | 25231 |
| Hexadecimal (base 16) | 2A99 |
| Base 3 | 112221220 |
| As time | 10905 seconds = 3 h 1 min 45 s |
Is 10905 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 (10905 ÷ 3 = 3635) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10905 ÷ 5 = 2181) | 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 6) | 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 1) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10905 a prime number?
No. 10905 = 3 × 5 × 727, so it is divisible by 3.
What are the factors of 10905?
1, 3, 5, 15, 727, 2181, 3635, 10905.
What is 10905 in binary?
10101010011001 (hexadecimal 2A99, octal 25231).
What is the square root of 10905?
About 104.4270.
Is 10905 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 10905?
10905 is a Harshad number: divisible by its digit sum 15.