The number 94502
94502 is a composite number with 4 divisors. Its prime factorisation is 2 × 47251. Divisors (4): 1, 2, 47251, 94502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94502: a semiprime: 2 × 47251, the product of two primes.
- 2
94502 is composite. Its prime factorisation is
- 3
The divisors add up to 141756; without 94502 itself that is 47254, so 94502 is deficient (47254 is less than 94502). Euler's totient φ(94502) = 47250 numbers up to 94502 share no factor with it.
- 4
The digits of 94502 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94502 = 2 \times 47251 \]
94502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 141756 |
| Euler totient φ(n) | 47250 |
| Square | 8930628004 |
| Cube | 843962207634008 |
| Square root | 307.411776 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.4502 × |
94502 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand five hundred and two |
| Binary (base 2) | 10111000100100110 |
| Octal (base 8) | 270446 |
| Hexadecimal (base 16) | 17126 |
| Base 3 | 11210122002 |
| As time | 94502 seconds = 26 h 15 min 2 s |
Is 94502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94502 ÷ 2 = 47251) | 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 | 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 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94502 a prime number?
No. 94502 = 2 × 47251, so it is divisible by 2.
What are the factors of 94502?
1, 2, 47251, 94502.
What is 94502 in binary?
10111000100100110 (hexadecimal 17126, octal 270446).
What is the square root of 94502?
About 307.4118.
Is 94502 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 94502?
94502 is a semiprime: 2 × 47251, the product of two primes.