The number 70141
70141 is a twin prime (70139 and 70141 are both prime) and the 6951st prime number. Its only divisors are 1 and 70141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 70141: a twin prime (70139 and 70141 are both prime); the 6951st prime number.
- 2
70141 is prime, so its only factors are 1 and 70141. It is the 6951st prime; the next prime is 70157 and the one before is 70139.
- 3
The divisors add up to 70142; without 70141 itself that is 1, so 70141 is deficient (1 is less than 70141). Euler's totient φ(70141) = 70140 numbers up to 70141 share no factor with it.
- 4
The digits of 70141 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 68 steps to reach 1.
70141 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 70142 |
| Euler totient φ(n) | 70140 |
| Square | 4919759881 |
| Cube | 345076877813221 |
| Square root | 264.841462 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 68 |
| Scientific notation | 7.0141 × |
70141 in other forms
| Form | Value |
|---|---|
| In words | seventy thousand one hundred and forty-one |
| Binary (base 2) | 10001000111111101 |
| Octal (base 8) | 210775 |
| Hexadecimal (base 16) | 111FD |
| Base 3 | 10120012211 |
| As time | 70141 seconds = 19 h 29 min 1 s |
Is 70141 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 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 70141 a prime number?
Yes. 70141 is divisible only by 1 and itself.
What are the factors of 70141?
1, 70141.
What is 70141 in binary?
10001000111111101 (hexadecimal 111FD, octal 210775).
What is the square root of 70141?
About 264.8415.
Is 70141 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 70141?
70141 is a twin prime (70139 and 70141 are both prime); the 6951st prime number.