The number 74692
74692 is a composite number with 12 divisors. Its prime factorisation is × 71 × 263. Divisors (12): 1, 2, 4, 71, 142, 263, 284, 526, 1052, 18673, 37346, 74692.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
74692 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
74692 is composite. Its prime factorisation is
- 3
The divisors add up to 133056; without 74692 itself that is 58364, so 74692 is deficient (58364 is less than 74692). Euler's totient φ(74692) = 36680 numbers up to 74692 share no factor with it.
- 4
The digits of 74692 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 74692 = 2^{2} \times 71 \times 263 \]74692 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 133056 |
| Euler totient φ(n) | 36680 |
| Square | 5578894864 |
| Cube | 416698815181888 |
| Square root | 273.298372 (= 2√18673) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 37 |
| Scientific notation | 7.4692 × |
74692 in other forms
| Form | Value |
|---|---|
| In words | seventy-four thousand six hundred and ninety-two |
| Binary (base 2) | 10010001111000100 |
| Octal (base 8) | 221704 |
| Hexadecimal (base 16) | 123C4 |
| Base 3 | 10210110101 |
| As time | 74692 seconds = 20 h 44 min 52 s |
Is 74692 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (74692 ÷ 2 = 37346) | 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 | Yes (74692 ÷ 4 = 18673) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 74692 a prime number?
No. 74692 = × 71 × 263, so it is divisible by 2.
What are the factors of 74692?
1, 2, 4, 71, 142, 263, 284, 526, 1052, 18673, 37346, 74692.
What is 74692 in binary?
10010001111000100 (hexadecimal 123C4, octal 221704).
What is the square root of 74692?
About 273.2984, exactly 2√18673.
Is 74692 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 74692?
It is a composite number with 12 divisors.