The number 74852
74852 is a composite number with 6 divisors. Its prime factorisation is × 18713. Divisors (6): 1, 2, 4, 18713, 37426, 74852.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
74852 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
74852 is composite. Its prime factorisation is
- 3
The divisors add up to 130998; without 74852 itself that is 56146, so 74852 is deficient (56146 is less than 74852). Euler's totient φ(74852) = 37424 numbers up to 74852 share no factor with it.
- 4
The digits of 74852 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 200 steps to reach 1.
LaTeX source of the formulas on this page
\[ 74852 = 2^{2} \times 18713 \]74852 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 130998 |
| Euler totient φ(n) | 37424 |
| Square | 5602821904 |
| Cube | 419382425158208 |
| Square root | 273.590936 (= 2√18713) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 200 |
| Scientific notation | 7.4852 × |
74852 in other forms
| Form | Value |
|---|---|
| In words | seventy-four thousand eight hundred and fifty-two |
| Binary (base 2) | 10010010001100100 |
| Octal (base 8) | 222144 |
| Hexadecimal (base 16) | 12464 |
| Base 3 | 10210200022 |
| As time | 74852 seconds = 20 h 47 min 32 s |
Is 74852 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (74852 ÷ 2 = 37426) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (74852 ÷ 4 = 18713) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 74852 a prime number?
No. 74852 = × 18713, so it is divisible by 2.
What are the factors of 74852?
1, 2, 4, 18713, 37426, 74852.
What is 74852 in binary?
10010010001100100 (hexadecimal 12464, octal 222144).
What is the square root of 74852?
About 273.5909, exactly 2√18713.
Is 74852 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 74852?
It is a composite number with 6 divisors.