The number 6399
6399 is a composite number with 10 divisors. Its prime factorisation is × 79. Divisors (10): 1, 3, 9, 27, 79, 81, 237, 711, 2133, 6399.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6399: a Harshad number: divisible by its digit sum 27.
- 2
6399 is composite. Its prime factorisation is
- 3
The divisors add up to 9680; without 6399 itself that is 3281, so 6399 is deficient (3281 is less than 6399). Euler's totient φ(6399) = 4212 numbers up to 6399 share no factor with it.
- 4
The digits of 6399 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 168 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6399 = 3^{4} \times 79 \]6399 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 9680 |
| Euler totient φ(n) | 4212 |
| Square | 40947201 |
| Cube | 262021139199 |
| Square root | 79.993750 (= 9√79) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 168 |
| Scientific notation | 6.399 × |
6399 in other forms
| Form | Value |
|---|---|
| In words | six thousand three hundred and ninety-nine |
| Binary (base 2) | 1100011111111 |
| Octal (base 8) | 14377 |
| Hexadecimal (base 16) | 18FF |
| Base 3 | 22210000 |
| As time | 6399 seconds = 1 h 46 min 39 s |
Is 6399 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 (6399 ÷ 3 = 2133) | 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 4) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (6399 ÷ 9 = 711) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 6399 a prime number?
No. 6399 = × 79, so it is divisible by 3.
What are the factors of 6399?
1, 3, 9, 27, 79, 81, 237, 711, 2133, 6399.
What is 6399 in binary?
1100011111111 (hexadecimal 18FF, octal 14377).
What is the square root of 6399?
About 79.9937, exactly 9√79.
Is 6399 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 6399?
6399 is a Harshad number: divisible by its digit sum 27.