The number 61398
61398 is a composite number with 20 divisors. Its prime factorisation is 2 × × 379. Divisors (20): 1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 379, 758, 1137, 2274, 3411, 6822 … 61398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61398: a Harshad number: divisible by its digit sum 27.
- 2
61398 is composite. Its prime factorisation is
- 3
The divisors add up to 137940; without 61398 itself that is 76542, so 61398 is abundant (76542 is more than 61398). Euler's totient φ(61398) = 20412 numbers up to 61398 share no factor with it.
- 4
The digits of 61398 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61398 = 2 \times 3^{4} \times 379 \]61398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 137940 |
| Euler totient φ(n) | 20412 |
| Square | 3769714404 |
| Cube | 231452924976792 |
| Square root | 247.786198 (= 9√758) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 117 |
| Scientific notation | 6.1398 × |
61398 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand three hundred and ninety-eight |
| Binary (base 2) | 1110111111010110 |
| Octal (base 8) | 167726 |
| Hexadecimal (base 16) | EFD6 |
| Base 3 | 10010020000 |
| As time | 61398 seconds = 17 h 3 min 18 s |
Is 61398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61398 ÷ 2 = 30699) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (61398 ÷ 3 = 20466) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (61398 ÷ 6 = 10233) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (61398 ÷ 9 = 6822) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61398 a prime number?
No. 61398 = 2 × × 379, so it is divisible by 2.
What are the factors of 61398?
1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 379, 758, 1137, 2274, 3411, 6822, 10233, 20466, 30699, 61398.
What is 61398 in binary?
1110111111010110 (hexadecimal EFD6, octal 167726).
What is the square root of 61398?
About 247.7862, exactly 9√758.
Is 61398 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 61398?
61398 is a Harshad number: divisible by its digit sum 27.