The number 62141
62141 is a twin prime (62141 and 62143 are both prime) and the 6247th prime number. Its only divisors are 1 and 62141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 62141: a twin prime (62141 and 62143 are both prime); the 6247th prime number.
- 2
62141 is prime, so its only factors are 1 and 62141. It is the 6247th prime; the next prime is 62143 and the one before is 62137.
- 3
The divisors add up to 62142; without 62141 itself that is 1, so 62141 is deficient (1 is less than 62141). Euler's totient φ(62141) = 62140 numbers up to 62141 share no factor with it.
- 4
The digits of 62141 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
62141 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 62142 |
| Euler totient φ(n) | 62140 |
| Square | 3861503881 |
| Cube | 239957712669221 |
| Square root | 249.280966 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 117 |
| Scientific notation | 6.2141 × |
62141 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand one hundred and forty-one |
| Binary (base 2) | 1111001010111101 |
| Octal (base 8) | 171275 |
| Hexadecimal (base 16) | F2BD |
| Base 3 | 10011020112 |
| As time | 62141 seconds = 17 h 15 min 41 s |
Is 62141 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 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 2) | 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 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 62141 a prime number?
Yes. 62141 is divisible only by 1 and itself.
What are the factors of 62141?
1, 62141.
What is 62141 in binary?
1111001010111101 (hexadecimal F2BD, octal 171275).
What is the square root of 62141?
About 249.2810.
Is 62141 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 62141?
62141 is a twin prime (62141 and 62143 are both prime); the 6247th prime number.