The number 74802
74802 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 7 × 13 × 137. Divisors (32): 1, 2, 3, 6, 7, 13, 14, 21, 26, 39, 42, 78, 91, 137, 182, 273 … 74802.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 74802: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
74802 is composite. Its prime factorisation is
- 3
The divisors add up to 185472; without 74802 itself that is 110670, so 74802 is abundant (110670 is more than 74802). Euler's totient φ(74802) = 19584 numbers up to 74802 share no factor with it.
- 4
The digits of 74802 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 74802 = 2 \times 3 \times 7 \times 13 \times 137 \]
74802 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 185472 |
| Euler totient φ(n) | 19584 |
| Square | 5595339204 |
| Cube | 418542563137608 |
| Square root | 273.499543 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 112 |
| Scientific notation | 7.4802 × |
74802 in other forms
| Form | Value |
|---|---|
| In words | seventy-four thousand eight hundred and two |
| Binary (base 2) | 10010010000110010 |
| Octal (base 8) | 222062 |
| Hexadecimal (base 16) | 12432 |
| Base 3 | 10210121110 |
| As time | 74802 seconds = 20 h 46 min 42 s |
Is 74802 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (74802 ÷ 2 = 37401) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (74802 ÷ 3 = 24934) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (74802 ÷ 6 = 12467) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (74802 ÷ 7 = 10686) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 74802 a prime number?
No. 74802 = 2 × 3 × 7 × 13 × 137, so it is divisible by 2.
What are the factors of 74802?
1, 2, 3, 6, 7, 13, 14, 21, 26, 39, 42, 78, 91, 137, 182, 273, 274, 411, 546, 822, 959, 1781, 1918, 2877, 3562, 5343, 5754, 10686, 12467, 24934, 37401, 74802.
What is 74802 in binary?
10010010000110010 (hexadecimal 12432, octal 222062).
What is the square root of 74802?
About 273.4995.
Is 74802 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 74802?
74802 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.