The number 71951
71951 is a composite number with 8 divisors. Its prime factorisation is 11 × 31 × 211. Divisors (8): 1, 11, 31, 211, 341, 2321, 6541, 71951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
71951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
71951 is composite. Its prime factorisation is
- 3
The divisors add up to 81408; without 71951 itself that is 9457, so 71951 is deficient (9457 is less than 71951). Euler's totient φ(71951) = 63000 numbers up to 71951 share no factor with it.
- 4
The digits of 71951 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 187 steps to reach 1.
LaTeX source of the formulas on this page
\[ 71951 = 11 \times 31 \times 211 \]
71951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81408 |
| Euler totient φ(n) | 63000 |
| Square | 5176946401 |
| Cube | 372486470498351 |
| Square root | 268.236836 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 187 |
| Scientific notation | 7.1951 × |
71951 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand nine hundred and fifty-one |
| Binary (base 2) | 10001100100001111 |
| Octal (base 8) | 214417 |
| Hexadecimal (base 16) | 1190F |
| Base 3 | 10122200212 |
| As time | 71951 seconds = 19 h 59 min 11 s |
Is 71951 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 5) | 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 5) | 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 (71951 ÷ 11 = 6541) | 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 71951 a prime number?
No. 71951 = 11 × 31 × 211, so it is divisible by 11.
What are the factors of 71951?
1, 11, 31, 211, 341, 2321, 6541, 71951.
What is 71951 in binary?
10001100100001111 (hexadecimal 1190F, octal 214417).
What is the square root of 71951?
About 268.2368.
Is 71951 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 71951?
It is a composite number with 8 divisors.