The number 70391
70391 is a composite number with 4 divisors. Its prime factorisation is 43 × 1637. Divisors (4): 1, 43, 1637, 70391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 70391: a semiprime: 43 × 1637, the product of two primes.
- 2
70391 is composite. Its prime factorisation is
- 3
The divisors add up to 72072; without 70391 itself that is 1681, so 70391 is deficient (1681 is less than 70391). Euler's totient φ(70391) = 68712 numbers up to 70391 share no factor with it.
- 4
The digits of 70391 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 70391 = 43 \times 1637 \]
70391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 72072 |
| Euler totient φ(n) | 68712 |
| Square | 4954892881 |
| Cube | 348779864786471 |
| Square root | 265.313023 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 130 |
| Scientific notation | 7.0391 × |
70391 in other forms
| Form | Value |
|---|---|
| In words | seventy thousand three hundred and ninety-one |
| Binary (base 2) | 10001001011110111 |
| Octal (base 8) | 211367 |
| Hexadecimal (base 16) | 112F7 |
| Base 3 | 10120120002 |
| As time | 70391 seconds = 19 h 33 min 11 s |
Is 70391 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 6) | 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 2) | 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 2) | 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 70391 a prime number?
No. 70391 = 43 × 1637, so it is divisible by 43.
What are the factors of 70391?
1, 43, 1637, 70391.
What is 70391 in binary?
10001001011110111 (hexadecimal 112F7, octal 211367).
What is the square root of 70391?
About 265.3130.
Is 70391 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 70391?
70391 is a semiprime: 43 × 1637, the product of two primes.