The number 61251
61251 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 1201. Divisors (8): 1, 3, 17, 51, 1201, 3603, 20417, 61251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61251 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61251 is composite. Its prime factorisation is
- 3
The divisors add up to 86544; without 61251 itself that is 25293, so 61251 is deficient (25293 is less than 61251). Euler's totient φ(61251) = 38400 numbers up to 61251 share no factor with it.
- 4
The digits of 61251 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
\[ 61251 = 3 \times 17 \times 1201 \]
61251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 86544 |
| Euler totient φ(n) | 38400 |
| Square | 3751685001 |
| Cube | 229794457996251 |
| Square root | 247.489394 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.1251 × |
61251 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand two hundred and fifty-one |
| Binary (base 2) | 1110111101000011 |
| Octal (base 8) | 167503 |
| Hexadecimal (base 16) | EF43 |
| Base 3 | 10010000120 |
| As time | 61251 seconds = 17 h 0 min 51 s |
Is 61251 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 (61251 ÷ 3 = 20417) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61251 a prime number?
No. 61251 = 3 × 17 × 1201, so it is divisible by 3.
What are the factors of 61251?
1, 3, 17, 51, 1201, 3603, 20417, 61251.
What is 61251 in binary?
1110111101000011 (hexadecimal EF43, octal 167503).
What is the square root of 61251?
About 247.4894.
Is 61251 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 61251?
It is a composite number with 8 divisors.