The number 55481
55481 is a composite number with 4 divisors. Its prime factorisation is 109 × 509. Divisors (4): 1, 109, 509, 55481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55481: a semiprime: 109 × 509, the product of two primes.
- 2
55481 is composite. Its prime factorisation is
- 3
The divisors add up to 56100; without 55481 itself that is 619, so 55481 is deficient (619 is less than 55481). Euler's totient φ(55481) = 54864 numbers up to 55481 share no factor with it.
- 4
The digits of 55481 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55481 = 109 \times 509 \]
55481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56100 |
| Euler totient φ(n) | 54864 |
| Square | 3078141361 |
| Cube | 170778360849641 |
| Square root | 235.544051 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5481 × |
55481 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and eighty-one |
| Binary (base 2) | 1101100010111001 |
| Octal (base 8) | 154271 |
| Hexadecimal (base 16) | D8B9 |
| Base 3 | 2211002212 |
| As time | 55481 seconds = 15 h 24 min 41 s |
Is 55481 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 1) | 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 | No (remainder 6) | 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 5) | 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 8) | 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 55481 a prime number?
No. 55481 = 109 × 509, so it is divisible by 109.
What are the factors of 55481?
1, 109, 509, 55481.
What is 55481 in binary?
1101100010111001 (hexadecimal D8B9, octal 154271).
What is the square root of 55481?
About 235.5441.
Is 55481 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55481?
55481 is a semiprime: 109 × 509, the product of two primes.