The number 90152
90152 is a composite number with 16 divisors. Its prime factorisation is × 59 × 191. Divisors (16): 1, 2, 4, 8, 59, 118, 191, 236, 382, 472, 764, 1528, 11269, 22538, 45076, 90152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90152 is composite. Its prime factorisation is
- 3
The divisors add up to 172800; without 90152 itself that is 82648, so 90152 is deficient (82648 is less than 90152). Euler's totient φ(90152) = 44080 numbers up to 90152 share no factor with it.
- 4
The digits of 90152 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90152 = 2^{3} \times 59 \times 191 \]90152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 172800 |
| Euler totient φ(n) | 44080 |
| Square | 8127383104 |
| Cube | 732699841591808 |
| Square root | 300.253226 (= 2√22538) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0152 × |
90152 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand one hundred and fifty-two |
| Binary (base 2) | 10110000000101000 |
| Octal (base 8) | 260050 |
| Hexadecimal (base 16) | 16028 |
| Base 3 | 11120122222 |
| As time | 90152 seconds = 25 h 2 min 32 s |
Is 90152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90152 ÷ 2 = 45076) | 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 | Yes (90152 ÷ 4 = 22538) | 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 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 | Yes (90152 ÷ 8 = 11269) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90152 a prime number?
No. 90152 = × 59 × 191, so it is divisible by 2.
What are the factors of 90152?
1, 2, 4, 8, 59, 118, 191, 236, 382, 472, 764, 1528, 11269, 22538, 45076, 90152.
What is 90152 in binary?
10110000000101000 (hexadecimal 16028, octal 260050).
What is the square root of 90152?
About 300.2532, exactly 2√22538.
Is 90152 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 90152?
It is a composite number with 16 divisors.