The number 9149
9149 is a composite number with 4 divisors. Its prime factorisation is 7 × 1307. Divisors (4): 1, 7, 1307, 9149.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9149: a semiprime: 7 × 1307, the product of two primes.
- 2
9149 is composite. Its prime factorisation is
- 3
The divisors add up to 10464; without 9149 itself that is 1315, so 9149 is deficient (1315 is less than 9149). Euler's totient φ(9149) = 7836 numbers up to 9149 share no factor with it.
- 4
The digits of 9149 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9149 = 7 \times 1307 \]
9149 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 10464 |
| Euler totient φ(n) | 7836 |
| Square | 83704201 |
| Cube | 765809734949 |
| Square root | 95.650405 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 122 |
| Scientific notation | 9.149 × |
9149 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and forty-nine |
| Binary (base 2) | 10001110111101 |
| Octal (base 8) | 21675 |
| Hexadecimal (base 16) | 23BD |
| Base 3 | 110112212 |
| As time | 9149 seconds = 2 h 32 min 29 s |
Is 9149 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (9149 ÷ 7 = 1307) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9149 a prime number?
No. 9149 = 7 × 1307, so it is divisible by 7.
What are the factors of 9149?
1, 7, 1307, 9149.
What is 9149 in binary?
10001110111101 (hexadecimal 23BD, octal 21675).
What is the square root of 9149?
About 95.6504.
Is 9149 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 9149?
9149 is a semiprime: 7 × 1307, the product of two primes.