The number 71513
71513 is a composite number with 4 divisors. Its prime factorisation is 13 × 5501. Divisors (4): 1, 13, 5501, 71513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 71513: a semiprime: 13 × 5501, the product of two primes.
- 2
71513 is composite. Its prime factorisation is
- 3
The divisors add up to 77028; without 71513 itself that is 5515, so 71513 is deficient (5515 is less than 71513). Euler's totient φ(71513) = 66000 numbers up to 71513 share no factor with it.
- 4
The digits of 71513 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 71513 = 13 \times 5501 \]
71513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 77028 |
| Euler totient φ(n) | 66000 |
| Square | 5114109169 |
| Cube | 365725289002697 |
| Square root | 267.419147 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 125 |
| Scientific notation | 7.1513 × |
71513 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand five hundred and thirteen |
| Binary (base 2) | 10001011101011001 |
| Octal (base 8) | 213531 |
| Hexadecimal (base 16) | 11759 |
| Base 3 | 10122002122 |
| As time | 71513 seconds = 19 h 51 min 53 s |
Is 71513 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 71513 a prime number?
No. 71513 = 13 × 5501, so it is divisible by 13.
What are the factors of 71513?
1, 13, 5501, 71513.
What is 71513 in binary?
10001011101011001 (hexadecimal 11759, octal 213531).
What is the square root of 71513?
About 267.4191.
Is 71513 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 71513?
71513 is a semiprime: 13 × 5501, the product of two primes.