The number 47602
47602 is a composite number with 4 divisors. Its prime factorisation is 2 × 23801. Divisors (4): 1, 2, 23801, 47602.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47602: a semiprime: 2 × 23801, the product of two primes.
- 2
47602 is composite. Its prime factorisation is
- 3
The divisors add up to 71406; without 47602 itself that is 23804, so 47602 is deficient (23804 is less than 47602). Euler's totient φ(47602) = 23800 numbers up to 47602 share no factor with it.
- 4
The digits of 47602 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47602 = 2 \times 23801 \]
47602 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71406 |
| Euler totient φ(n) | 23800 |
| Square | 2265950404 |
| Cube | 107863771131208 |
| Square root | 218.178826 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.7602 × |
47602 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand six hundred and two |
| Binary (base 2) | 1011100111110010 |
| Octal (base 8) | 134762 |
| Hexadecimal (base 16) | B9F2 |
| Base 3 | 2102022001 |
| As time | 47602 seconds = 13 h 13 min 22 s |
Is 47602 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47602 ÷ 2 = 23801) | 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 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 | 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 2) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47602 a prime number?
No. 47602 = 2 × 23801, so it is divisible by 2.
What are the factors of 47602?
1, 2, 23801, 47602.
What is 47602 in binary?
1011100111110010 (hexadecimal B9F2, octal 134762).
What is the square root of 47602?
About 218.1788.
Is 47602 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 47602?
47602 is a semiprime: 2 × 23801, the product of two primes.