The number 90502
90502 is a composite number with 8 divisors. Its prime factorisation is 2 × 37 × 1223. Divisors (8): 1, 2, 37, 74, 1223, 2446, 45251, 90502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90502 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90502 is composite. Its prime factorisation is
- 3
The divisors add up to 139536; without 90502 itself that is 49034, so 90502 is deficient (49034 is less than 90502). Euler's totient φ(90502) = 43992 numbers up to 90502 share no factor with it.
- 4
The digits of 90502 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90502 = 2 \times 37 \times 1223 \]
90502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 139536 |
| Euler totient φ(n) | 43992 |
| Square | 8190612004 |
| Cube | 741266767586008 |
| Square root | 300.835503 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0502 × |
90502 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and two |
| Binary (base 2) | 10110000110000110 |
| Octal (base 8) | 260606 |
| Hexadecimal (base 16) | 16186 |
| Base 3 | 11121010221 |
| As time | 90502 seconds = 25 h 8 min 22 s |
Is 90502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90502 ÷ 2 = 45251) | 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 6) | 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 7) | 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 90502 a prime number?
No. 90502 = 2 × 37 × 1223, so it is divisible by 2.
What are the factors of 90502?
1, 2, 37, 74, 1223, 2446, 45251, 90502.
What is 90502 in binary?
10110000110000110 (hexadecimal 16186, octal 260606).
What is the square root of 90502?
About 300.8355.
Is 90502 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 90502?
It is a composite number with 8 divisors.