The number 55483
55483 is a composite number with 4 divisors. Its prime factorisation is 113 × 491. Divisors (4): 1, 113, 491, 55483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55483: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 113 × 491, the product of two primes.
- 2
55483 is composite. Its prime factorisation is
- 3
The divisors add up to 56088; without 55483 itself that is 605, so 55483 is deficient (605 is less than 55483). Euler's totient φ(55483) = 54880 numbers up to 55483 share no factor with it.
- 4
The digits of 55483 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55483 = 113 \times 491 \]
55483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56088 |
| Euler totient φ(n) | 54880 |
| Square | 3078363289 |
| Cube | 170796830363587 |
| Square root | 235.548297 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.5483 × |
55483 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and eighty-three |
| Binary (base 2) | 1101100010111011 |
| Octal (base 8) | 154273 |
| Hexadecimal (base 16) | D8BB |
| Base 3 | 2211002221 |
| As time | 55483 seconds = 15 h 24 min 43 s |
Is 55483 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55483 a prime number?
No. 55483 = 113 × 491, so it is divisible by 113.
What are the factors of 55483?
1, 113, 491, 55483.
What is 55483 in binary?
1101100010111011 (hexadecimal D8BB, octal 154273).
What is the square root of 55483?
About 235.5483.
Is 55483 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55483?
55483 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 113 × 491, the product of two primes.