The number 31401
31401 is a composite number with 8 divisors. Its prime factorisation is × 1163. Divisors (8): 1, 3, 9, 27, 1163, 3489, 10467, 31401.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 31401: a Harshad number: divisible by its digit sum 9.
- 2
31401 is composite. Its prime factorisation is
- 3
The divisors add up to 46560; without 31401 itself that is 15159, so 31401 is deficient (15159 is less than 31401). Euler's totient φ(31401) = 20916 numbers up to 31401 share no factor with it.
- 4
The digits of 31401 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31401 = 3^{3} \times 1163 \]31401 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 46560 |
| Euler totient φ(n) | 20916 |
| Square | 986022801 |
| Cube | 30962101974201 |
| Square root | 177.203273 (= 3√3489) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 129 |
| Scientific notation | 3.1401 × |
31401 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand four hundred and one |
| Binary (base 2) | 111101010101001 |
| Octal (base 8) | 75251 |
| Hexadecimal (base 16) | 7AA9 |
| Base 3 | 1121002000 |
| As time | 31401 seconds = 8 h 43 min 21 s |
Is 31401 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 (31401 ÷ 3 = 10467) | 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 6) | 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 | Yes (31401 ÷ 9 = 3489) | 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 7) | 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 31401 a prime number?
No. 31401 = × 1163, so it is divisible by 3.
What are the factors of 31401?
1, 3, 9, 27, 1163, 3489, 10467, 31401.
What is 31401 in binary?
111101010101001 (hexadecimal 7AA9, octal 75251).
What is the square root of 31401?
About 177.2033, exactly 3√3489.
Is 31401 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 31401?
31401 is a Harshad number: divisible by its digit sum 9.