The number 55261
55261 is a composite number with 4 divisors. Its prime factorisation is 73 × 757. Divisors (4): 1, 73, 757, 55261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55261: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 757, the product of two primes.
- 2
55261 is composite. Its prime factorisation is
- 3
The divisors add up to 56092; without 55261 itself that is 831, so 55261 is deficient (831 is less than 55261). Euler's totient φ(55261) = 54432 numbers up to 55261 share no factor with it.
- 4
The digits of 55261 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55261 = 73 \times 757 \]
55261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56092 |
| Euler totient φ(n) | 54432 |
| Square | 3053778121 |
| Cube | 168754832744581 |
| Square root | 235.076583 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.5261 × |
55261 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand two hundred and sixty-one |
| Binary (base 2) | 1101011111011101 |
| Octal (base 8) | 153735 |
| Hexadecimal (base 16) | D7DD |
| Base 3 | 2210210201 |
| As time | 55261 seconds = 15 h 21 min 1 s |
Is 55261 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55261 a prime number?
No. 55261 = 73 × 757, so it is divisible by 73.
What are the factors of 55261?
1, 73, 757, 55261.
What is 55261 in binary?
1101011111011101 (hexadecimal D7DD, octal 153735).
What is the square root of 55261?
About 235.0766.
Is 55261 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 55261?
55261 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 757, the product of two primes.