The number 55497
55497 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1423. Divisors (8): 1, 3, 13, 39, 1423, 4269, 18499, 55497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55497 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55497 is composite. Its prime factorisation is
- 3
The divisors add up to 79744; without 55497 itself that is 24247, so 55497 is deficient (24247 is less than 55497). Euler's totient φ(55497) = 34128 numbers up to 55497 share no factor with it.
- 4
The digits of 55497 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55497 = 3 \times 13 \times 1423 \]
55497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79744 |
| Euler totient φ(n) | 34128 |
| Square | 3079917009 |
| Cube | 170926154248473 |
| Square root | 235.578013 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5497 × |
55497 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and ninety-seven |
| Binary (base 2) | 1101100011001001 |
| Octal (base 8) | 154311 |
| Hexadecimal (base 16) | D8C9 |
| Base 3 | 2211010110 |
| As time | 55497 seconds = 15 h 24 min 57 s |
Is 55497 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 (55497 ÷ 3 = 18499) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | 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 2) | 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 55497 a prime number?
No. 55497 = 3 × 13 × 1423, so it is divisible by 3.
What are the factors of 55497?
1, 3, 13, 39, 1423, 4269, 18499, 55497.
What is 55497 in binary?
1101100011001001 (hexadecimal D8C9, octal 154311).
What is the square root of 55497?
About 235.5780.
Is 55497 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 55497?
It is a composite number with 8 divisors.