The number 6405
6405 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 61. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 61, 105, 183, 305, 427, 915, 1281, 2135, 6405.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6405: a Harshad number: divisible by its digit sum 15.
- 2
6405 is composite. Its prime factorisation is
- 3
The divisors add up to 11904; without 6405 itself that is 5499, so 6405 is deficient (5499 is less than 6405). Euler's totient φ(6405) = 2880 numbers up to 6405 share no factor with it.
- 4
The digits of 6405 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
\[ 6405 = 3 \times 5 \times 7 \times 61 \]
6405 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 11904 |
| Euler totient φ(n) | 2880 |
| Square | 41024025 |
| Cube | 262758880125 |
| Square root | 80.031244 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 62 |
| Scientific notation | 6.405 × |
6405 in other forms
| Form | Value |
|---|---|
| In words | six thousand four hundred and five |
| Binary (base 2) | 1100100000101 |
| Octal (base 8) | 14405 |
| Hexadecimal (base 16) | 1905 |
| Base 3 | 22210020 |
| As time | 6405 seconds = 1 h 46 min 45 s |
Is 6405 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 (6405 ÷ 3 = 2135) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (6405 ÷ 5 = 1281) | 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 | Yes (6405 ÷ 7 = 915) | 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 5) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6405 a prime number?
No. 6405 = 3 × 5 × 7 × 61, so it is divisible by 3.
What are the factors of 6405?
1, 3, 5, 7, 15, 21, 35, 61, 105, 183, 305, 427, 915, 1281, 2135, 6405.
What is 6405 in binary?
1100100000101 (hexadecimal 1905, octal 14405).
What is the square root of 6405?
About 80.0312.
Is 6405 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 6405?
6405 is a Harshad number: divisible by its digit sum 15.