The number 90567
90567 is a composite number with 12 divisors. Its prime factorisation is × 29 × 347. Divisors (12): 1, 3, 9, 29, 87, 261, 347, 1041, 3123, 10063, 30189, 90567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90567 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90567 is composite. Its prime factorisation is
- 3
The divisors add up to 135720; without 90567 itself that is 45153, so 90567 is deficient (45153 is less than 90567). Euler's totient φ(90567) = 58128 numbers up to 90567 share no factor with it.
- 4
The digits of 90567 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90567 = 3^{2} \times 29 \times 347 \]90567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 135720 |
| Euler totient φ(n) | 58128 |
| Square | 8202381489 |
| Cube | 742865084314263 |
| Square root | 300.943516 (= 3√10063) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.0567 × |
90567 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and sixty-seven |
| Binary (base 2) | 10110000111000111 |
| Octal (base 8) | 260707 |
| Hexadecimal (base 16) | 161C7 |
| Base 3 | 11121020100 |
| As time | 90567 seconds = 25 h 9 min 27 s |
Is 90567 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 (90567 ÷ 3 = 30189) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (90567 ÷ 9 = 10063) | 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 4) | 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 90567 a prime number?
No. 90567 = × 29 × 347, so it is divisible by 3.
What are the factors of 90567?
1, 3, 9, 29, 87, 261, 347, 1041, 3123, 10063, 30189, 90567.
What is 90567 in binary?
10110000111000111 (hexadecimal 161C7, octal 260707).
What is the square root of 90567?
About 300.9435, exactly 3√10063.
Is 90567 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 90567?
It is a composite number with 12 divisors.