The number 61951
61951 is a composite number with 4 divisors. Its prime factorisation is 41 × 1511. Divisors (4): 1, 41, 1511, 61951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61951: a semiprime: 41 × 1511, the product of two primes.
- 2
61951 is composite. Its prime factorisation is
- 3
The divisors add up to 63504; without 61951 itself that is 1553, so 61951 is deficient (1553 is less than 61951). Euler's totient φ(61951) = 60400 numbers up to 61951 share no factor with it.
- 4
The digits of 61951 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61951 = 41 \times 1511 \]
61951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63504 |
| Euler totient φ(n) | 60400 |
| Square | 3837926401 |
| Cube | 237763378468351 |
| Square root | 248.899578 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 161 |
| Scientific notation | 6.1951 × |
61951 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand nine hundred and fifty-one |
| Binary (base 2) | 1111000111111111 |
| Octal (base 8) | 170777 |
| Hexadecimal (base 16) | F1FF |
| Base 3 | 10010222111 |
| As time | 61951 seconds = 17 h 12 min 31 s |
Is 61951 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 | No (remainder 1) | 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 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61951 a prime number?
No. 61951 = 41 × 1511, so it is divisible by 41.
What are the factors of 61951?
1, 41, 1511, 61951.
What is 61951 in binary?
1111000111111111 (hexadecimal F1FF, octal 170777).
What is the square root of 61951?
About 248.8996.
Is 61951 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 61951?
61951 is a semiprime: 41 × 1511, the product of two primes.