The number 9138
9138 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1523. Divisors (8): 1, 2, 3, 6, 1523, 3046, 4569, 9138.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9138 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9138 is composite. Its prime factorisation is
- 3
The divisors add up to 18288; without 9138 itself that is 9150, so 9138 is abundant (9150 is more than 9138). Euler's totient φ(9138) = 3044 numbers up to 9138 share no factor with it.
- 4
The digits of 9138 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 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9138 = 2 \times 3 \times 1523 \]
9138 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18288 |
| Euler totient φ(n) | 3044 |
| Square | 83503044 |
| Cube | 763050816072 |
| Square root | 95.592887 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 34 |
| Scientific notation | 9.138 × |
9138 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and thirty-eight |
| Binary (base 2) | 10001110110010 |
| Octal (base 8) | 21662 |
| Hexadecimal (base 16) | 23B2 |
| Base 3 | 110112110 |
| As time | 9138 seconds = 2 h 32 min 18 s |
Is 9138 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9138 ÷ 2 = 4569) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9138 ÷ 3 = 3046) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (9138 ÷ 6 = 1523) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9138 a prime number?
No. 9138 = 2 × 3 × 1523, so it is divisible by 2.
What are the factors of 9138?
1, 2, 3, 6, 1523, 3046, 4569, 9138.
What is 9138 in binary?
10001110110010 (hexadecimal 23B2, octal 21662).
What is the square root of 9138?
About 95.5929.
Is 9138 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9138?
It is a composite number with 8 divisors.