The number 90052
90052 is a composite number with 12 divisors. Its prime factorisation is × 47 × 479. Divisors (12): 1, 2, 4, 47, 94, 188, 479, 958, 1916, 22513, 45026, 90052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90052 is composite. Its prime factorisation is
- 3
The divisors add up to 161280; without 90052 itself that is 71228, so 90052 is deficient (71228 is less than 90052). Euler's totient φ(90052) = 43976 numbers up to 90052 share no factor with it.
- 4
The digits of 90052 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 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90052 = 2^{2} \times 47 \times 479 \]90052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 161280 |
| Euler totient φ(n) | 43976 |
| Square | 8109362704 |
| Cube | 730264330220608 |
| Square root | 300.086654 (= 2√22513) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.0052 × |
90052 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand and fifty-two |
| Binary (base 2) | 10101111111000100 |
| Octal (base 8) | 257704 |
| Hexadecimal (base 16) | 15FC4 |
| Base 3 | 11120112021 |
| As time | 90052 seconds = 25 h 0 min 52 s |
Is 90052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90052 ÷ 2 = 45026) | 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 | Yes (90052 ÷ 4 = 22513) | 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 4) | 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 4) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90052 a prime number?
No. 90052 = × 47 × 479, so it is divisible by 2.
What are the factors of 90052?
1, 2, 4, 47, 94, 188, 479, 958, 1916, 22513, 45026, 90052.
What is 90052 in binary?
10101111111000100 (hexadecimal 15FC4, octal 257704).
What is the square root of 90052?
About 300.0867, exactly 2√22513.
Is 90052 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 90052?
It is a composite number with 12 divisors.