The number 5481
5481 is a composite number with 16 divisors. Its prime factorisation is × 7 × 29. Divisors (16): 1, 3, 7, 9, 21, 27, 29, 63, 87, 189, 203, 261, 609, 783, 1827, 5481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5481 is composite. Its prime factorisation is
- 3
The divisors add up to 9600; without 5481 itself that is 4119, so 5481 is deficient (4119 is less than 5481). Euler's totient φ(5481) = 3024 numbers up to 5481 share no factor with it.
- 4
The digits of 5481 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
\[ 5481 = 3^{3} \times 7 \times 29 \]5481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 9600 |
| Euler totient φ(n) | 3024 |
| Square | 30041361 |
| Cube | 164656699641 |
| Square root | 74.033776 (= 3√609) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 41 |
| Scientific notation | 5.481 × |
5481 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and eighty-one |
| Binary (base 2) | 1010101101001 |
| Octal (base 8) | 12551 |
| Hexadecimal (base 16) | 1569 |
| Base 3 | 21112000 |
| As time | 5481 seconds = 1 h 31 min 21 s |
Is 5481 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5481 ÷ 3 = 1827) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5481 ÷ 7 = 783) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (5481 ÷ 9 = 609) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5481 a prime number?
No. 5481 = × 7 × 29, so it is divisible by 3.
What are the factors of 5481?
1, 3, 7, 9, 21, 27, 29, 63, 87, 189, 203, 261, 609, 783, 1827, 5481.
What is 5481 in binary?
1010101101001 (hexadecimal 1569, octal 12551).
What is the square root of 5481?
About 74.0338, exactly 3√609.
Is 5481 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 5481?
It is a composite number with 16 divisors.