The number 71032
71032 is a composite number with 16 divisors. Its prime factorisation is × 13 × 683. Divisors (16): 1, 2, 4, 8, 13, 26, 52, 104, 683, 1366, 2732, 5464, 8879, 17758, 35516, 71032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 71032: a Harshad number: divisible by its digit sum 13.
- 2
71032 is composite. Its prime factorisation is
- 3
The divisors add up to 143640; without 71032 itself that is 72608, so 71032 is abundant (72608 is more than 71032). Euler's totient φ(71032) = 32736 numbers up to 71032 share no factor with it.
- 4
The digits of 71032 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 71032 = 2^{3} \times 13 \times 683 \]71032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 143640 |
| Euler totient φ(n) | 32736 |
| Square | 5045545024 |
| Cube | 358395154144768 |
| Square root | 266.518292 (= 2√17758) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 174 |
| Scientific notation | 7.1032 × |
71032 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand and thirty-two |
| Binary (base 2) | 10001010101111000 |
| Octal (base 8) | 212570 |
| Hexadecimal (base 16) | 11578 |
| Base 3 | 10121102211 |
| As time | 71032 seconds = 19 h 43 min 52 s |
Is 71032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (71032 ÷ 2 = 35516) | 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 | Yes (71032 ÷ 4 = 17758) | 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 4) | 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 | Yes (71032 ÷ 8 = 8879) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 71032 a prime number?
No. 71032 = × 13 × 683, so it is divisible by 2.
What are the factors of 71032?
1, 2, 4, 8, 13, 26, 52, 104, 683, 1366, 2732, 5464, 8879, 17758, 35516, 71032.
What is 71032 in binary?
10001010101111000 (hexadecimal 11578, octal 212570).
What is the square root of 71032?
About 266.5183, exactly 2√17758.
Is 71032 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 71032?
71032 is a Harshad number: divisible by its digit sum 13.