The number 76941
76941 is a composite number with 12 divisors. Its prime factorisation is × 83 × 103. Divisors (12): 1, 3, 9, 83, 103, 249, 309, 747, 927, 8549, 25647, 76941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
76941 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
76941 is composite. Its prime factorisation is
- 3
The divisors add up to 113568; without 76941 itself that is 36627, so 76941 is deficient (36627 is less than 76941). Euler's totient φ(76941) = 50184 numbers up to 76941 share no factor with it.
- 4
The digits of 76941 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 76941 = 3^{2} \times 83 \times 103 \]76941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 113568 |
| Euler totient φ(n) | 50184 |
| Square | 5919917481 |
| Cube | 455484370905621 |
| Square root | 277.382408 (= 3√8549) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 50 |
| Scientific notation | 7.6941 × |
76941 in other forms
| Form | Value |
|---|---|
| In words | seventy-six thousand nine hundred and forty-one |
| Binary (base 2) | 10010110010001101 |
| Octal (base 8) | 226215 |
| Hexadecimal (base 16) | 12C8D |
| Base 3 | 10220112200 |
| As time | 76941 seconds = 21 h 22 min 21 s |
Is 76941 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 (76941 ÷ 3 = 25647) | 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 4) | 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 | Yes (76941 ÷ 9 = 8549) | 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 7) | 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 76941 a prime number?
No. 76941 = × 83 × 103, so it is divisible by 3.
What are the factors of 76941?
1, 3, 9, 83, 103, 249, 309, 747, 927, 8549, 25647, 76941.
What is 76941 in binary?
10010110010001101 (hexadecimal 12C8D, octal 226215).
What is the square root of 76941?
About 277.3824, exactly 3√8549.
Is 76941 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 76941?
It is a composite number with 12 divisors.