The number 6415
6415 is a composite number with 4 divisors. Its prime factorisation is 5 × 1283. Divisors (4): 1, 5, 1283, 6415.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6415: a semiprime: 5 × 1283, the product of two primes.
- 2
6415 is composite. Its prime factorisation is
- 3
The divisors add up to 7704; without 6415 itself that is 1289, so 6415 is deficient (1289 is less than 6415). Euler's totient φ(6415) = 5128 numbers up to 6415 share no factor with it.
- 4
The digits of 6415 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 49 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6415 = 5 \times 1283 \]
6415 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7704 |
| Euler totient φ(n) | 5128 |
| Square | 41152225 |
| Cube | 263991523375 |
| Square root | 80.093695 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 49 |
| Scientific notation | 6.415 × |
6415 in other forms
| Form | Value |
|---|---|
| In words | six thousand four hundred and fifteen |
| Binary (base 2) | 1100100001111 |
| Octal (base 8) | 14417 |
| Hexadecimal (base 16) | 190F |
| Base 3 | 22210121 |
| As time | 6415 seconds = 1 h 46 min 55 s |
Is 6415 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 (6415 ÷ 5 = 1283) | 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 3) | 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 7) | 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 2) | 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 6415 a prime number?
No. 6415 = 5 × 1283, so it is divisible by 5.
What are the factors of 6415?
1, 5, 1283, 6415.
What is 6415 in binary?
1100100001111 (hexadecimal 190F, octal 14417).
What is the square root of 6415?
About 80.0937.
Is 6415 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 6415?
6415 is a semiprime: 5 × 1283, the product of two primes.