The number 74691
74691 is a triangular number: 1 + 2 + … + 386 = 74691. Its prime factorisation is × 43 × 193. Divisors (12): 1, 3, 9, 43, 129, 193, 387, 579, 1737, 8299, 24897, 74691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 74691: a triangular number: 1 + 2 + … + 386 = 74691.
- 2
74691 is composite. Its prime factorisation is
- 3
The divisors add up to 110968; without 74691 itself that is 36277, so 74691 is deficient (36277 is less than 74691). Euler's totient φ(74691) = 48384 numbers up to 74691 share no factor with it.
- 4
The digits of 74691 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 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 74691 = 3^{2} \times 43 \times 193 \]74691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 110968 |
| Euler totient φ(n) | 48384 |
| Square | 5578745481 |
| Cube | 416682078721371 |
| Square root | 273.296542 (= 3√8299) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 138 |
| Scientific notation | 7.4691 × |
74691 in other forms
| Form | Value |
|---|---|
| In words | seventy-four thousand six hundred and ninety-one |
| Binary (base 2) | 10010001111000011 |
| Octal (base 8) | 221703 |
| Hexadecimal (base 16) | 123C3 |
| Base 3 | 10210110100 |
| As time | 74691 seconds = 20 h 44 min 51 s |
Is 74691 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 (74691 ÷ 3 = 24897) | 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 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (74691 ÷ 9 = 8299) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 74691 a prime number?
No. 74691 = × 43 × 193, so it is divisible by 3.
What are the factors of 74691?
1, 3, 9, 43, 129, 193, 387, 579, 1737, 8299, 24897, 74691.
What is 74691 in binary?
10010001111000011 (hexadecimal 123C3, octal 221703).
What is the square root of 74691?
About 273.2965, exactly 3√8299.
Is 74691 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 74691?
74691 is a triangular number: 1 + 2 + … + 386 = 74691.