The number 15315
15315 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1021. Divisors (8): 1, 3, 5, 15, 1021, 3063, 5105, 15315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15315: a Harshad number: divisible by its digit sum 15.
- 2
15315 is composite. Its prime factorisation is
- 3
The divisors add up to 24528; without 15315 itself that is 9213, so 15315 is deficient (9213 is less than 15315). Euler's totient φ(15315) = 8160 numbers up to 15315 share no factor with it.
- 4
The digits of 15315 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15315 = 3 \times 5 \times 1021 \]
15315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24528 |
| Euler totient φ(n) | 8160 |
| Square | 234549225 |
| Cube | 3592121380875 |
| Square root | 123.753788 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5315 × |
15315 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and fifteen |
| Binary (base 2) | 11101111010011 |
| Octal (base 8) | 35723 |
| Hexadecimal (base 16) | 3BD3 |
| Base 3 | 210000020 |
| As time | 15315 seconds = 4 h 15 min 15 s |
Is 15315 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 (15315 ÷ 3 = 5105) | 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 (15315 ÷ 5 = 3063) | 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 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 3) | 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 15315 a prime number?
No. 15315 = 3 × 5 × 1021, so it is divisible by 3.
What are the factors of 15315?
1, 3, 5, 15, 1021, 3063, 5105, 15315.
What is 15315 in binary?
11101111010011 (hexadecimal 3BD3, octal 35723).
What is the square root of 15315?
About 123.7538.
Is 15315 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15315?
15315 is a Harshad number: divisible by its digit sum 15.