The number 77961
77961 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1999. Divisors (8): 1, 3, 13, 39, 1999, 5997, 25987, 77961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
77961 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
77961 is composite. Its prime factorisation is
- 3
The divisors add up to 112000; without 77961 itself that is 34039, so 77961 is deficient (34039 is less than 77961). Euler's totient φ(77961) = 47952 numbers up to 77961 share no factor with it.
- 4
The digits of 77961 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 169 steps to reach 1.
LaTeX source of the formulas on this page
\[ 77961 = 3 \times 13 \times 1999 \]
77961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 112000 |
| Euler totient φ(n) | 47952 |
| Square | 6077917521 |
| Cube | 473840527854681 |
| Square root | 279.214971 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 169 |
| Scientific notation | 7.7961 × |
77961 in other forms
| Form | Value |
|---|---|
| In words | seventy-seven thousand nine hundred and sixty-one |
| Binary (base 2) | 10011000010001001 |
| Octal (base 8) | 230211 |
| Hexadecimal (base 16) | 13089 |
| Base 3 | 10221221110 |
| As time | 77961 seconds = 21 h 39 min 21 s |
Is 77961 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 (77961 ÷ 3 = 25987) | 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 2) | 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 4) | 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 77961 a prime number?
No. 77961 = 3 × 13 × 1999, so it is divisible by 3.
What are the factors of 77961?
1, 3, 13, 39, 1999, 5997, 25987, 77961.
What is 77961 in binary?
10011000010001001 (hexadecimal 13089, octal 230211).
What is the square root of 77961?
About 279.2150.
Is 77961 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 77961?
It is a composite number with 8 divisors.