The number 5537
5537 is a composite number with 6 divisors. Its prime factorisation is Ć 113. Divisors (6): 1, 7, 49, 113, 791, 5537.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5537 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5537 is composite. Its prime factorisation is
- 3
The divisors add up to 6498; without 5537 itself that is 961, so 5537 is deficient (961 is less than 5537). Euler's totient Ļ(5537) = 4704 numbers up to 5537 share no factor with it.
- 4
The digits of 5537 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5537 = 7^{2} \times 113 \]5537 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 6498 |
| Euler totient Ļ(n) | 4704 |
| Square | 30658369 |
| Cube | 169755389153 |
| Square root | 74.411021 (= 7ā113) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 67 |
| Scientific notation | 5.537 Ć |
5537 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and thirty-seven |
| Binary (base 2) | 1010110100001 |
| Octal (base 8) | 12641 |
| Hexadecimal (base 16) | 15A1 |
| Base 3 | 21121002 |
| As time | 5537 seconds = 1 h 32 min 17 s |
Is 5537 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 | No (remainder 2) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5537 Ć· 7 = 791) | 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 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5537 a prime number?
No. 5537 = Ć 113, so it is divisible by 7.
What are the factors of 5537?
1, 7, 49, 113, 791, 5537.
What is 5537 in binary?
1010110100001 (hexadecimal 15A1, octal 12641).
What is the square root of 5537?
About 74.4110, exactly 7ā113.
Is 5537 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 5537?
It is a composite number with 6 divisors.