The number 76141
76141 is a composite number with 4 divisors. Its prime factorisation is 13 × 5857. Divisors (4): 1, 13, 5857, 76141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 76141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 5857, the product of two primes.
- 2
76141 is composite. Its prime factorisation is
- 3
The divisors add up to 82012; without 76141 itself that is 5871, so 76141 is deficient (5871 is less than 76141). Euler's totient φ(76141) = 70272 numbers up to 76141 share no factor with it.
- 4
The digits of 76141 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 76141 = 13 \times 5857 \]
76141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 82012 |
| Euler totient φ(n) | 70272 |
| Square | 5797451881 |
| Cube | 441423783671221 |
| Square root | 275.936587 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 94 |
| Scientific notation | 7.6141 × |
76141 in other forms
| Form | Value |
|---|---|
| In words | seventy-six thousand one hundred and forty-one |
| Binary (base 2) | 10010100101101101 |
| Octal (base 8) | 224555 |
| Hexadecimal (base 16) | 1296D |
| Base 3 | 10212110001 |
| As time | 76141 seconds = 21 h 9 min 1 s |
Is 76141 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 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 76141 a prime number?
No. 76141 = 13 × 5857, so it is divisible by 13.
What are the factors of 76141?
1, 13, 5857, 76141.
What is 76141 in binary?
10010100101101101 (hexadecimal 1296D, octal 224555).
What is the square root of 76141?
About 275.9366.
Is 76141 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 76141?
76141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 5857, the product of two primes.