The number 4550
4550 is a composite number with 24 divisors. Its prime factorisation is 2 × × 7 × 13. Divisors (24): 1, 2, 5, 7, 10, 13, 14, 25, 26, 35, 50, 65, 70, 91, 130, 175 … 4550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4550: a Harshad number: divisible by its digit sum 14.
- 2
4550 is composite. Its prime factorisation is
- 3
The divisors add up to 10416; without 4550 itself that is 5866, so 4550 is abundant (5866 is more than 4550). Euler's totient φ(4550) = 1440 numbers up to 4550 share no factor with it.
- 4
The digits of 4550 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 20 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4550 = 2 \times 5^{2} \times 7 \times 13 \]4550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 10416 |
| Euler totient φ(n) | 1440 |
| Square | 20702500 |
| Cube | 94196375000 |
| Square root | 67.453688 (= 5√182) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 20 |
| Scientific notation | 4.55 × |
4550 in other forms
| Form | Value |
|---|---|
| In words | four thousand five hundred and fifty |
| Binary (base 2) | 1000111000110 |
| Octal (base 8) | 10706 |
| Hexadecimal (base 16) | 11C6 |
| Base 3 | 20020112 |
| As time | 4550 seconds = 1 h 15 min 50 s |
Is 4550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4550 ÷ 2 = 2275) | 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 (4550 ÷ 5 = 910) | 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 | Yes (4550 ÷ 7 = 650) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (4550 ÷ 10 = 455) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 4550 a prime number?
No. 4550 = 2 × × 7 × 13, so it is divisible by 2.
What are the factors of 4550?
1, 2, 5, 7, 10, 13, 14, 25, 26, 35, 50, 65, 70, 91, 130, 175, 182, 325, 350, 455, 650, 910, 2275, 4550.
What is 4550 in binary?
1000111000110 (hexadecimal 11C6, octal 10706).
What is the square root of 4550?
About 67.4537, exactly 5√182.
Is 4550 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 4550?
4550 is a Harshad number: divisible by its digit sum 14.