The number 5490
5490 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 61. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 61, 90, 122, 183, 305 … 5490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5490: a Harshad number: divisible by its digit sum 18.
- 2
5490 is composite. Its prime factorisation is
- 3
The divisors add up to 14508; without 5490 itself that is 9018, so 5490 is abundant (9018 is more than 5490). Euler's totient φ(5490) = 1440 numbers up to 5490 share no factor with it.
- 4
The digits of 5490 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5490 = 2 \times 3^{2} \times 5 \times 61 \]5490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 14508 |
| Euler totient φ(n) | 1440 |
| Square | 30140100 |
| Cube | 165469149000 |
| Square root | 74.094534 (= 3√610) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 41 |
| Scientific notation | 5.49 × |
5490 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and ninety |
| Binary (base 2) | 1010101110010 |
| Octal (base 8) | 12562 |
| Hexadecimal (base 16) | 1572 |
| Base 3 | 21112100 |
| As time | 5490 seconds = 1 h 31 min 30 s |
Is 5490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5490 ÷ 2 = 2745) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5490 ÷ 3 = 1830) | 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 (5490 ÷ 5 = 1098) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (5490 ÷ 6 = 915) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (5490 ÷ 9 = 610) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5490 ÷ 10 = 549) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5490 a prime number?
No. 5490 = 2 × × 5 × 61, so it is divisible by 2.
What are the factors of 5490?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 61, 90, 122, 183, 305, 366, 549, 610, 915, 1098, 1830, 2745, 5490.
What is 5490 in binary?
1010101110010 (hexadecimal 1572, octal 12562).
What is the square root of 5490?
About 74.0945, exactly 3√610.
Is 5490 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 5490?
5490 is a Harshad number: divisible by its digit sum 18.