The number 7150
7150 is a composite number with 24 divisors. Its prime factorisation is 2 × × 11 × 13. Divisors (24): 1, 2, 5, 10, 11, 13, 22, 25, 26, 50, 55, 65, 110, 130, 143, 275 … 7150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 7150: a Harshad number: divisible by its digit sum 13.
- 2
7150 is composite. Its prime factorisation is
- 3
The divisors add up to 15624; without 7150 itself that is 8474, so 7150 is abundant (8474 is more than 7150). Euler's totient φ(7150) = 2400 numbers up to 7150 share no factor with it.
- 4
The digits of 7150 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 49 steps to reach 1.
LaTeX source of the formulas on this page
\[ 7150 = 2 \times 5^{2} \times 11 \times 13 \]7150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 15624 |
| Euler totient φ(n) | 2400 |
| Square | 51122500 |
| Cube | 365525875000 |
| Square root | 84.557673 (= 5√286) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 49 |
| Scientific notation | 7.15 × |
7150 in other forms
| Form | Value |
|---|---|
| In words | seven thousand one hundred and fifty |
| Binary (base 2) | 1101111101110 |
| Octal (base 8) | 15756 |
| Hexadecimal (base 16) | 1BEE |
| Base 3 | 100210211 |
| As time | 7150 seconds = 1 h 59 min 10 s |
Is 7150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (7150 ÷ 2 = 3575) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | Yes (7150 ÷ 5 = 1430) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (7150 ÷ 10 = 715) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (7150 ÷ 11 = 650) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 7150 a prime number?
No. 7150 = 2 × × 11 × 13, so it is divisible by 2.
What are the factors of 7150?
1, 2, 5, 10, 11, 13, 22, 25, 26, 50, 55, 65, 110, 130, 143, 275, 286, 325, 550, 650, 715, 1430, 3575, 7150.
What is 7150 in binary?
1101111101110 (hexadecimal 1BEE, octal 15756).
What is the square root of 7150?
About 84.5577, exactly 5√286.
Is 7150 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 7150?
7150 is a Harshad number: divisible by its digit sum 13.