The number 71002
71002 is a composite number with 8 divisors. Its prime factorisation is 2 × 131 × 271. Divisors (8): 1, 2, 131, 262, 271, 542, 35501, 71002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
71002 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
71002 is composite. Its prime factorisation is
- 3
The divisors add up to 107712; without 71002 itself that is 36710, so 71002 is deficient (36710 is less than 71002). Euler's totient φ(71002) = 35100 numbers up to 71002 share no factor with it.
- 4
The digits of 71002 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 71002 = 2 \times 131 \times 271 \]
71002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 107712 |
| Euler totient φ(n) | 35100 |
| Square | 5041284004 |
| Cube | 357941246852008 |
| Square root | 266.462005 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 99 |
| Scientific notation | 7.1002 × |
71002 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand and two |
| Binary (base 2) | 10001010101011010 |
| Octal (base 8) | 212532 |
| Hexadecimal (base 16) | 1155A |
| Base 3 | 10121101201 |
| As time | 71002 seconds = 19 h 43 min 22 s |
Is 71002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (71002 ÷ 2 = 35501) | 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 2) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 71002 a prime number?
No. 71002 = 2 × 131 × 271, so it is divisible by 2.
What are the factors of 71002?
1, 2, 131, 262, 271, 542, 35501, 71002.
What is 71002 in binary?
10001010101011010 (hexadecimal 1155A, octal 212532).
What is the square root of 71002?
About 266.4620.
Is 71002 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 71002?
It is a composite number with 8 divisors.