The number 15915
15915 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1061. Divisors (8): 1, 3, 5, 15, 1061, 3183, 5305, 15915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15915: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15915 is composite. Its prime factorisation is
- 3
The divisors add up to 25488; without 15915 itself that is 9573, so 15915 is deficient (9573 is less than 15915). Euler's totient φ(15915) = 8480 numbers up to 15915 share no factor with it.
- 4
The digits of 15915 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15915 = 3 \times 5 \times 1061 \]
15915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25488 |
| Euler totient φ(n) | 8480 |
| Square | 253287225 |
| Cube | 4031066185875 |
| Square root | 126.154667 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.5915 × |
15915 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and fifteen |
| Binary (base 2) | 11111000101011 |
| Octal (base 8) | 37053 |
| Hexadecimal (base 16) | 3E2B |
| Base 3 | 210211110 |
| As time | 15915 seconds = 4 h 25 min 15 s |
Is 15915 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 (15915 ÷ 3 = 5305) | 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 (15915 ÷ 5 = 3183) | 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 4) | 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 3) | 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 15915 a prime number?
No. 15915 = 3 × 5 × 1061, so it is divisible by 3.
What are the factors of 15915?
1, 3, 5, 15, 1061, 3183, 5305, 15915.
What is 15915 in binary?
11111000101011 (hexadecimal 3E2B, octal 37053).
What is the square root of 15915?
About 126.1547.
Is 15915 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15915?
15915 is a happy number: repeatedly adding the squares of its digits reaches 1.