The number 7550
7550 is a composite number with 12 divisors. Its prime factorisation is 2 × × 151. Divisors (12): 1, 2, 5, 10, 25, 50, 151, 302, 755, 1510, 3775, 7550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
7550 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
7550 is composite. Its prime factorisation is
- 3
The divisors add up to 14136; without 7550 itself that is 6586, so 7550 is deficient (6586 is less than 7550). Euler's totient φ(7550) = 3000 numbers up to 7550 share no factor with it.
- 4
The digits of 7550 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 7550 = 2 \times 5^{2} \times 151 \]7550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 14136 |
| Euler totient φ(n) | 3000 |
| Square | 57002500 |
| Cube | 430368875000 |
| Square root | 86.890736 (= 5√302) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 88 |
| Scientific notation | 7.55 × |
7550 in other forms
| Form | Value |
|---|---|
| In words | seven thousand five hundred and fifty |
| Binary (base 2) | 1110101111110 |
| Octal (base 8) | 16576 |
| Hexadecimal (base 16) | 1D7E |
| Base 3 | 101100122 |
| As time | 7550 seconds = 2 h 5 min 50 s |
Is 7550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (7550 ÷ 2 = 3775) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (7550 ÷ 5 = 1510) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (7550 ÷ 10 = 755) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 7550 a prime number?
No. 7550 = 2 × × 151, so it is divisible by 2.
What are the factors of 7550?
1, 2, 5, 10, 25, 50, 151, 302, 755, 1510, 3775, 7550.
What is 7550 in binary?
1110101111110 (hexadecimal 1D7E, octal 16576).
What is the square root of 7550?
About 86.8907, exactly 5√302.
Is 7550 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 7550?
It is a composite number with 12 divisors.