The number 61701
61701 is a composite number with 8 divisors. Its prime factorisation is 3 × 131 × 157. Divisors (8): 1, 3, 131, 157, 393, 471, 20567, 61701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61701 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61701 is composite. Its prime factorisation is
- 3
The divisors add up to 83424; without 61701 itself that is 21723, so 61701 is deficient (21723 is less than 61701). Euler's totient φ(61701) = 40560 numbers up to 61701 share no factor with it.
- 4
The digits of 61701 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61701 = 3 \times 131 \times 157 \]
61701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 83424 |
| Euler totient φ(n) | 40560 |
| Square | 3807013401 |
| Cube | 234896533855101 |
| Square root | 248.396860 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.1701 × |
61701 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand seven hundred and one |
| Binary (base 2) | 1111000100000101 |
| Octal (base 8) | 170405 |
| Hexadecimal (base 16) | F105 |
| Base 3 | 10010122020 |
| As time | 61701 seconds = 17 h 8 min 21 s |
Is 61701 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 (61701 ÷ 3 = 20567) | 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 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 5) | 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 2) | 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 61701 a prime number?
No. 61701 = 3 × 131 × 157, so it is divisible by 3.
What are the factors of 61701?
1, 3, 131, 157, 393, 471, 20567, 61701.
What is 61701 in binary?
1111000100000101 (hexadecimal F105, octal 170405).
What is the square root of 61701?
About 248.3969.
Is 61701 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 61701?
It is a composite number with 8 divisors.