The number 6401
6401 is a composite number with 4 divisors. Its prime factorisation is 37 × 173. Divisors (4): 1, 37, 173, 6401.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6401: a semiprime: 37 × 173, the product of two primes.
- 2
6401 is composite. Its prime factorisation is
- 3
The divisors add up to 6612; without 6401 itself that is 211, so 6401 is deficient (211 is less than 6401). Euler's totient φ(6401) = 6192 numbers up to 6401 share no factor with it.
- 4
The digits of 6401 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 124 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6401 = 37 \times 173 \]
6401 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6612 |
| Euler totient φ(n) | 6192 |
| Square | 40972801 |
| Cube | 262266899201 |
| Square root | 80.006250 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 124 |
| Scientific notation | 6.401 × |
6401 in other forms
| Form | Value |
|---|---|
| In words | six thousand four hundred and one |
| Binary (base 2) | 1100100000001 |
| Octal (base 8) | 14401 |
| Hexadecimal (base 16) | 1901 |
| Base 3 | 22210002 |
| As time | 6401 seconds = 1 h 46 min 41 s |
Is 6401 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 2) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6401 a prime number?
No. 6401 = 37 × 173, so it is divisible by 37.
What are the factors of 6401?
1, 37, 173, 6401.
What is 6401 in binary?
1100100000001 (hexadecimal 1901, octal 14401).
What is the square root of 6401?
About 80.0062.
Is 6401 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 6401?
6401 is a semiprime: 37 × 173, the product of two primes.