The number 5450
5450 is a composite number with 12 divisors. Its prime factorisation is 2 × × 109. Divisors (12): 1, 2, 5, 10, 25, 50, 109, 218, 545, 1090, 2725, 5450.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5450 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5450 is composite. Its prime factorisation is
- 3
The divisors add up to 10230; without 5450 itself that is 4780, so 5450 is deficient (4780 is less than 5450). Euler's totient φ(5450) = 2160 numbers up to 5450 share no factor with it.
- 4
The digits of 5450 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 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5450 = 2 \times 5^{2} \times 109 \]5450 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 10230 |
| Euler totient φ(n) | 2160 |
| Square | 29702500 |
| Cube | 161878625000 |
| Square root | 73.824115 (= 5√218) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 67 |
| Scientific notation | 5.45 × |
5450 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and fifty |
| Binary (base 2) | 1010101001010 |
| Octal (base 8) | 12512 |
| Hexadecimal (base 16) | 154A |
| Base 3 | 21110212 |
| As time | 5450 seconds = 1 h 30 min 50 s |
Is 5450 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5450 ÷ 2 = 2725) | 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 (5450 ÷ 5 = 1090) | 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 2) | 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 (5450 ÷ 10 = 545) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 5450 a prime number?
No. 5450 = 2 × × 109, so it is divisible by 2.
What are the factors of 5450?
1, 2, 5, 10, 25, 50, 109, 218, 545, 1090, 2725, 5450.
What is 5450 in binary?
1010101001010 (hexadecimal 154A, octal 12512).
What is the square root of 5450?
About 73.8241, exactly 5√218.
Is 5450 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 5450?
It is a composite number with 12 divisors.