The number 79141
79141 is a composite number with 4 divisors. Its prime factorisation is 29 × 2729. Divisors (4): 1, 29, 2729, 79141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 79141: a semiprime: 29 × 2729, the product of two primes.
- 2
79141 is composite. Its prime factorisation is
- 3
The divisors add up to 81900; without 79141 itself that is 2759, so 79141 is deficient (2759 is less than 79141). Euler's totient φ(79141) = 76384 numbers up to 79141 share no factor with it.
- 4
The digits of 79141 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 79141 = 29 \times 2729 \]
79141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 81900 |
| Euler totient φ(n) | 76384 |
| Square | 6263297881 |
| Cube | 495683657600221 |
| Square root | 281.320102 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 76 |
| Scientific notation | 7.9141 × |
79141 in other forms
| Form | Value |
|---|---|
| In words | seventy-nine thousand one hundred and forty-one |
| Binary (base 2) | 10011010100100101 |
| Octal (base 8) | 232445 |
| Hexadecimal (base 16) | 13525 |
| Base 3 | 11000120011 |
| As time | 79141 seconds = 21 h 59 min 1 s |
Is 79141 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 6) | 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 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 7) | 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 79141 a prime number?
No. 79141 = 29 × 2729, so it is divisible by 29.
What are the factors of 79141?
1, 29, 2729, 79141.
What is 79141 in binary?
10011010100100101 (hexadecimal 13525, octal 232445).
What is the square root of 79141?
About 281.3201.
Is 79141 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 79141?
79141 is a semiprime: 29 × 2729, the product of two primes.