The number 90147
90147 is a composite number with 8 divisors. Its prime factorisation is 3 × 151 × 199. Divisors (8): 1, 3, 151, 199, 453, 597, 30049, 90147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90147 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90147 is composite. Its prime factorisation is
- 3
The divisors add up to 121600; without 90147 itself that is 31453, so 90147 is deficient (31453 is less than 90147). Euler's totient φ(90147) = 59400 numbers up to 90147 share no factor with it.
- 4
The digits of 90147 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90147 = 3 \times 151 \times 199 \]
90147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 121600 |
| Euler totient φ(n) | 59400 |
| Square | 8126481609 |
| Cube | 732577937606523 |
| Square root | 300.244900 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0147 × |
90147 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand one hundred and forty-seven |
| Binary (base 2) | 10110000000100011 |
| Octal (base 8) | 260043 |
| Hexadecimal (base 16) | 16023 |
| Base 3 | 11120122210 |
| As time | 90147 seconds = 25 h 2 min 27 s |
Is 90147 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (90147 ÷ 3 = 30049) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90147 a prime number?
No. 90147 = 3 × 151 × 199, so it is divisible by 3.
What are the factors of 90147?
1, 3, 151, 199, 453, 597, 30049, 90147.
What is 90147 in binary?
10110000000100011 (hexadecimal 16023, octal 260043).
What is the square root of 90147?
About 300.2449.
Is 90147 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 90147?
It is a composite number with 8 divisors.