The number 10915
10915 is a composite number with 8 divisors. Its prime factorisation is 5 × 37 × 59. Divisors (8): 1, 5, 37, 59, 185, 295, 2183, 10915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10915 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10915 is composite. Its prime factorisation is
- 3
The divisors add up to 13680; without 10915 itself that is 2765, so 10915 is deficient (2765 is less than 10915). Euler's totient φ(10915) = 8352 numbers up to 10915 share no factor with it.
- 4
The digits of 10915 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10915 = 5 \times 37 \times 59 \]
10915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 13680 |
| Euler totient φ(n) | 8352 |
| Square | 119137225 |
| Cube | 1300382810875 |
| Square root | 104.474877 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.0915 × |
10915 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and fifteen |
| Binary (base 2) | 10101010100011 |
| Octal (base 8) | 25243 |
| Hexadecimal (base 16) | 2AA3 |
| Base 3 | 112222021 |
| As time | 10915 seconds = 3 h 1 min 55 s |
Is 10915 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 | No (remainder 1) | 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 (10915 ÷ 5 = 2183) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 7) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10915 a prime number?
No. 10915 = 5 × 37 × 59, so it is divisible by 5.
What are the factors of 10915?
1, 5, 37, 59, 185, 295, 2183, 10915.
What is 10915 in binary?
10101010100011 (hexadecimal 2AA3, octal 25243).
What is the square root of 10915?
About 104.4749.
Is 10915 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 10915?
It is a composite number with 8 divisors.