The number 55461
55461 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 19 × 139. Divisors (16): 1, 3, 7, 19, 21, 57, 133, 139, 399, 417, 973, 2641, 2919, 7923, 18487, 55461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55461: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
55461 is composite. Its prime factorisation is
- 3
The divisors add up to 89600; without 55461 itself that is 34139, so 55461 is deficient (34139 is less than 55461). Euler's totient φ(55461) = 29808 numbers up to 55461 share no factor with it.
- 4
The digits of 55461 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55461 = 3 \times 7 \times 19 \times 139 \]
55461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 89600 |
| Euler totient φ(n) | 29808 |
| Square | 3075922521 |
| Cube | 170593738937181 |
| Square root | 235.501592 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5461 × |
55461 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and sixty-one |
| Binary (base 2) | 1101100010100101 |
| Octal (base 8) | 154245 |
| Hexadecimal (base 16) | D8A5 |
| Base 3 | 2211002010 |
| As time | 55461 seconds = 15 h 24 min 21 s |
Is 55461 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 (55461 ÷ 3 = 18487) | 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 (55461 ÷ 7 = 7923) | 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 5) | 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 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55461 a prime number?
No. 55461 = 3 × 7 × 19 × 139, so it is divisible by 3.
What are the factors of 55461?
1, 3, 7, 19, 21, 57, 133, 139, 399, 417, 973, 2641, 2919, 7923, 18487, 55461.
What is 55461 in binary?
1101100010100101 (hexadecimal D8A5, octal 154245).
What is the square root of 55461?
About 235.5016.
Is 55461 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 55461?
55461 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.