The number 1401
1401 is a composite number with 4 divisors. Its prime factorisation is 3 × 467. Divisors (4): 1, 3, 467, 1401.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1401: a semiprime: 3 × 467, the product of two primes.
- 2
1401 is composite. Its prime factorisation is
- 3
The divisors add up to 1872; without 1401 itself that is 471, so 1401 is deficient (471 is less than 1401). Euler's totient φ(1401) = 932 numbers up to 1401 share no factor with it.
- 4
The digits of 1401 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1401 = 3 \times 467 \]
1401 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1872 |
| Euler totient φ(n) | 932 |
| Square | 1962801 |
| Cube | 2749884201 |
| Square root | 37.429935 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 1.401 × |
1401 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and one |
| Roman numerals | MCDI |
| Binary (base 2) | 10101111001 |
| Octal (base 8) | 2571 |
| Hexadecimal (base 16) | 579 |
| Base 3 | 1220220 |
| As time | 1401 seconds = 23 min 21 s |
Is 1401 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 (1401 ÷ 3 = 467) | 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 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 1401 a prime number?
No. 1401 = 3 × 467, so it is divisible by 3.
What are the factors of 1401?
1, 3, 467, 1401.
What is 1401 in binary?
10101111001 (hexadecimal 579, octal 2571).
What is the square root of 1401?
About 37.4299.
What is 1401 in Roman numerals?
MCDI.
Is 1401 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 1401?
1401 is a semiprime: 3 × 467, the product of two primes.