The number 90050
90050 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1801. Divisors (12): 1, 2, 5, 10, 25, 50, 1801, 3602, 9005, 18010, 45025, 90050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90050 is composite. Its prime factorisation is
- 3
The divisors add up to 167586; without 90050 itself that is 77536, so 90050 is deficient (77536 is less than 90050). Euler's totient φ(90050) = 36000 numbers up to 90050 share no factor with it.
- 4
The digits of 90050 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90050 = 2 \times 5^{2} \times 1801 \]90050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 167586 |
| Euler totient φ(n) | 36000 |
| Square | 8109002500 |
| Cube | 730215675125000 |
| Square root | 300.083322 (= 5√3602) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 195 |
| Scientific notation | 9.005 × |
90050 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand and fifty |
| Binary (base 2) | 10101111111000010 |
| Octal (base 8) | 257702 |
| Hexadecimal (base 16) | 15FC2 |
| Base 3 | 11120112012 |
| As time | 90050 seconds = 25 h 0 min 50 s |
Is 90050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90050 ÷ 2 = 45025) | 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 | Yes (90050 ÷ 5 = 18010) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (90050 ÷ 10 = 9005) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 90050 a prime number?
No. 90050 = 2 × × 1801, so it is divisible by 2.
What are the factors of 90050?
1, 2, 5, 10, 25, 50, 1801, 3602, 9005, 18010, 45025, 90050.
What is 90050 in binary?
10101111111000010 (hexadecimal 15FC2, octal 257702).
What is the square root of 90050?
About 300.0833, exactly 5√3602.
Is 90050 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 90050?
It is a composite number with 12 divisors.