The number 71151
71151 is a composite number with 8 divisors. Its prime factorisation is 3 × 37 × 641. Divisors (8): 1, 3, 37, 111, 641, 1923, 23717, 71151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
71151 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
71151 is composite. Its prime factorisation is
- 3
The divisors add up to 97584; without 71151 itself that is 26433, so 71151 is deficient (26433 is less than 71151). Euler's totient φ(71151) = 46080 numbers up to 71151 share no factor with it.
- 4
The digits of 71151 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 71151 = 3 \times 37 \times 641 \]
71151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 97584 |
| Euler totient φ(n) | 46080 |
| Square | 5062464801 |
| Cube | 360199433055951 |
| Square root | 266.741448 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 73 |
| Scientific notation | 7.1151 × |
71151 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand one hundred and fifty-one |
| Binary (base 2) | 10001010111101111 |
| Octal (base 8) | 212757 |
| Hexadecimal (base 16) | 115EF |
| Base 3 | 10121121020 |
| As time | 71151 seconds = 19 h 45 min 51 s |
Is 71151 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 | Yes (71151 ÷ 3 = 23717) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 71151 a prime number?
No. 71151 = 3 × 37 × 641, so it is divisible by 3.
What are the factors of 71151?
1, 3, 37, 111, 641, 1923, 23717, 71151.
What is 71151 in binary?
10001010111101111 (hexadecimal 115EF, octal 212757).
What is the square root of 71151?
About 266.7414.
Is 71151 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 71151?
It is a composite number with 8 divisors.