The number 61401
61401 is a composite number with 8 divisors. Its prime factorisation is 3 × 97 × 211. Divisors (8): 1, 3, 97, 211, 291, 633, 20467, 61401.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61401 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61401 is composite. Its prime factorisation is
- 3
The divisors add up to 83104; without 61401 itself that is 21703, so 61401 is deficient (21703 is less than 61401). Euler's totient φ(61401) = 40320 numbers up to 61401 share no factor with it.
- 4
The digits of 61401 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61401 = 3 \times 97 \times 211 \]
61401 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 83104 |
| Euler totient φ(n) | 40320 |
| Square | 3770082801 |
| Cube | 231486854064201 |
| Square root | 247.792252 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 6.1401 × |
61401 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand four hundred and one |
| Binary (base 2) | 1110111111011001 |
| Octal (base 8) | 167731 |
| Hexadecimal (base 16) | EFD9 |
| Base 3 | 10010020010 |
| As time | 61401 seconds = 17 h 3 min 21 s |
Is 61401 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 (61401 ÷ 3 = 20467) | 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 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 1) | 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 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61401 a prime number?
No. 61401 = 3 × 97 × 211, so it is divisible by 3.
What are the factors of 61401?
1, 3, 97, 211, 291, 633, 20467, 61401.
What is 61401 in binary?
1110111111011001 (hexadecimal EFD9, octal 167731).
What is the square root of 61401?
About 247.7923.
Is 61401 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 61401?
It is a composite number with 8 divisors.