The number 5951
5951 is a composite number with 4 divisors. Its prime factorisation is 11 × 541. Divisors (4): 1, 11, 541, 5951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5951: a semiprime: 11 × 541, the product of two primes.
- 2
5951 is composite. Its prime factorisation is
- 3
The divisors add up to 6504; without 5951 itself that is 553, so 5951 is deficient (553 is less than 5951). Euler's totient φ(5951) = 5400 numbers up to 5951 share no factor with it.
- 4
The digits of 5951 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 49 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5951 = 11 \times 541 \]
5951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6504 |
| Euler totient φ(n) | 5400 |
| Square | 35414401 |
| Cube | 210751100351 |
| Square root | 77.142725 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 49 |
| Scientific notation | 5.951 × |
5951 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and fifty-one |
| Binary (base 2) | 1011100111111 |
| Octal (base 8) | 13477 |
| Hexadecimal (base 16) | 173F |
| Base 3 | 22011102 |
| As time | 5951 seconds = 1 h 39 min 11 s |
Is 5951 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | 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 | Yes (5951 ÷ 11 = 541) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5951 a prime number?
No. 5951 = 11 × 541, so it is divisible by 11.
What are the factors of 5951?
1, 11, 541, 5951.
What is 5951 in binary?
1011100111111 (hexadecimal 173F, octal 13477).
What is the square root of 5951?
About 77.1427.
Is 5951 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 5951?
5951 is a semiprime: 11 × 541, the product of two primes.