The number 6315
6315 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 421. Divisors (8): 1, 3, 5, 15, 421, 1263, 2105, 6315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6315: a Harshad number: divisible by its digit sum 15.
- 2
6315 is composite. Its prime factorisation is
- 3
The divisors add up to 10128; without 6315 itself that is 3813, so 6315 is deficient (3813 is less than 6315). Euler's totient φ(6315) = 3360 numbers up to 6315 share no factor with it.
- 4
The digits of 6315 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 62 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6315 = 3 \times 5 \times 421 \]
6315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 10128 |
| Euler totient φ(n) | 3360 |
| Square | 39879225 |
| Cube | 251837305875 |
| Square root | 79.466974 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 62 |
| Scientific notation | 6.315 × |
6315 in other forms
| Form | Value |
|---|---|
| In words | six thousand three hundred and fifteen |
| Binary (base 2) | 1100010101011 |
| Octal (base 8) | 14253 |
| Hexadecimal (base 16) | 18AB |
| Base 3 | 22122220 |
| As time | 6315 seconds = 1 h 45 min 15 s |
Is 6315 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 (6315 ÷ 3 = 2105) | 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 (6315 ÷ 5 = 1263) | 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 1) | 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 1) | 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 6315 a prime number?
No. 6315 = 3 × 5 × 421, so it is divisible by 3.
What are the factors of 6315?
1, 3, 5, 15, 421, 1263, 2105, 6315.
What is 6315 in binary?
1100010101011 (hexadecimal 18AB, octal 14253).
What is the square root of 6315?
About 79.4670.
Is 6315 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 6315?
6315 is a Harshad number: divisible by its digit sum 15.