The number 55951
55951 is a composite number with 4 divisors. Its prime factorisation is 7 × 7993. Divisors (4): 1, 7, 7993, 55951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55951: a semiprime: 7 × 7993, the product of two primes.
- 2
55951 is composite. Its prime factorisation is
- 3
The divisors add up to 63952; without 55951 itself that is 8001, so 55951 is deficient (8001 is less than 55951). Euler's totient φ(55951) = 47952 numbers up to 55951 share no factor with it.
- 4
The digits of 55951 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55951 = 7 \times 7993 \]
55951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63952 |
| Euler totient φ(n) | 47952 |
| Square | 3130514401 |
| Cube | 175155411250351 |
| Square root | 236.539637 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5951 × |
55951 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and fifty-one |
| Binary (base 2) | 1101101010001111 |
| Octal (base 8) | 155217 |
| Hexadecimal (base 16) | DA8F |
| Base 3 | 2211202021 |
| As time | 55951 seconds = 15 h 32 min 31 s |
Is 55951 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 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 | Yes (55951 ÷ 7 = 7993) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 55951 a prime number?
No. 55951 = 7 × 7993, so it is divisible by 7.
What are the factors of 55951?
1, 7, 7993, 55951.
What is 55951 in binary?
1101101010001111 (hexadecimal DA8F, octal 155217).
What is the square root of 55951?
About 236.5396.
Is 55951 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55951?
55951 is a semiprime: 7 × 7993, the product of two primes.