The number 6402
6402 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 11 × 97. Divisors (16): 1, 2, 3, 6, 11, 22, 33, 66, 97, 194, 291, 582, 1067, 2134, 3201, 6402.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6402 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6402 is composite. Its prime factorisation is
- 3
The divisors add up to 14112; without 6402 itself that is 7710, so 6402 is abundant (7710 is more than 6402). Euler's totient φ(6402) = 1920 numbers up to 6402 share no factor with it.
- 4
The digits of 6402 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 168 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6402 = 2 \times 3 \times 11 \times 97 \]
6402 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 14112 |
| Euler totient φ(n) | 1920 |
| Square | 40985604 |
| Cube | 262389836808 |
| Square root | 80.012499 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 168 |
| Scientific notation | 6.402 × |
6402 in other forms
| Form | Value |
|---|---|
| In words | six thousand four hundred and two |
| Binary (base 2) | 1100100000010 |
| Octal (base 8) | 14402 |
| Hexadecimal (base 16) | 1902 |
| Base 3 | 22210010 |
| As time | 6402 seconds = 1 h 46 min 42 s |
Is 6402 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6402 ÷ 2 = 3201) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (6402 ÷ 3 = 2134) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (6402 ÷ 6 = 1067) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (6402 ÷ 11 = 582) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6402 a prime number?
No. 6402 = 2 × 3 × 11 × 97, so it is divisible by 2.
What are the factors of 6402?
1, 2, 3, 6, 11, 22, 33, 66, 97, 194, 291, 582, 1067, 2134, 3201, 6402.
What is 6402 in binary?
1100100000010 (hexadecimal 1902, octal 14402).
What is the square root of 6402?
About 80.0125.
Is 6402 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 6402?
It is a composite number with 16 divisors.