The number 915
915 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 61. Divisors (8): 1, 3, 5, 15, 61, 183, 305, 915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 915: a Harshad number: divisible by its digit sum 15.
- 2
915 is composite. Its prime factorisation is
- 3
The divisors add up to 1488; without 915 itself that is 573, so 915 is deficient (573 is less than 915). Euler's totient φ(915) = 480 numbers up to 915 share no factor with it.
- 4
The digits of 915 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 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 915 = 3 \times 5 \times 61 \]
915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1488 |
| Euler totient φ(n) | 480 |
| Square | 837225 |
| Cube | 766060875 |
| Square root | 30.248967 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 129 |
| Scientific notation | 9.15 × |
915 in other forms
| Form | Value |
|---|---|
| In words | nine hundred and fifteen |
| Roman numerals | CMXV |
| Binary (base 2) | 1110010011 |
| Octal (base 8) | 1623 |
| Hexadecimal (base 16) | 393 |
| Base 3 | 1020220 |
| As time | 915 seconds = 15 min 15 s |
Is 915 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 (915 ÷ 3 = 305) | 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 (915 ÷ 5 = 183) | 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 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 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 2) | 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 915 a prime number?
No. 915 = 3 × 5 × 61, so it is divisible by 3.
What are the factors of 915?
1, 3, 5, 15, 61, 183, 305, 915.
What is 915 in binary?
1110010011 (hexadecimal 393, octal 1623).
What is the square root of 915?
About 30.2490.
What is 915 in Roman numerals?
CMXV.
Is 915 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 915?
915 is a Harshad number: divisible by its digit sum 15.