The number 55922
55922 is a composite number with 4 divisors. Its prime factorisation is 2 × 27961. Divisors (4): 1, 2, 27961, 55922.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55922: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 27961, the product of two primes.
- 2
55922 is composite. Its prime factorisation is
- 3
The divisors add up to 83886; without 55922 itself that is 27964, so 55922 is deficient (27964 is less than 55922). Euler's totient φ(55922) = 27960 numbers up to 55922 share no factor with it.
- 4
The digits of 55922 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55922 = 2 \times 27961 \]
55922 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 83886 |
| Euler totient φ(n) | 27960 |
| Square | 3127270084 |
| Cube | 174883197637448 |
| Square root | 236.478329 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5922 × |
55922 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and twenty-two |
| Binary (base 2) | 1101101001110010 |
| Octal (base 8) | 155162 |
| Hexadecimal (base 16) | DA72 |
| Base 3 | 2211201012 |
| As time | 55922 seconds = 15 h 32 min 2 s |
Is 55922 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55922 ÷ 2 = 27961) | 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 2) | 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 2) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55922 a prime number?
No. 55922 = 2 × 27961, so it is divisible by 2.
What are the factors of 55922?
1, 2, 27961, 55922.
What is 55922 in binary?
1101101001110010 (hexadecimal DA72, octal 155162).
What is the square root of 55922?
About 236.4783.
Is 55922 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55922?
55922 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 27961, the product of two primes.