The number 6447
6447 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 307. Divisors (8): 1, 3, 7, 21, 307, 921, 2149, 6447.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6447: a Harshad number: divisible by its digit sum 21.
- 2
6447 is composite. Its prime factorisation is
- 3
The divisors add up to 9856; without 6447 itself that is 3409, so 6447 is deficient (3409 is less than 6447). Euler's totient φ(6447) = 3672 numbers up to 6447 share no factor with it.
- 4
The digits of 6447 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 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6447 = 3 \times 7 \times 307 \]
6447 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 9856 |
| Euler totient φ(n) | 3672 |
| Square | 41563809 |
| Cube | 267961876623 |
| Square root | 80.293213 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 75 |
| Scientific notation | 6.447 × |
6447 in other forms
| Form | Value |
|---|---|
| In words | six thousand four hundred and forty-seven |
| Binary (base 2) | 1100100101111 |
| Octal (base 8) | 14457 |
| Hexadecimal (base 16) | 192F |
| Base 3 | 22211210 |
| As time | 6447 seconds = 1 h 47 min 27 s |
Is 6447 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 (6447 ÷ 3 = 2149) | 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 | No (remainder 2) | 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 (6447 ÷ 7 = 921) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 6447 a prime number?
No. 6447 = 3 × 7 × 307, so it is divisible by 3.
What are the factors of 6447?
1, 3, 7, 21, 307, 921, 2149, 6447.
What is 6447 in binary?
1100100101111 (hexadecimal 192F, octal 14457).
What is the square root of 6447?
About 80.2932.
Is 6447 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 6447?
6447 is a Harshad number: divisible by its digit sum 21.