The number 93761
93761 is a twin prime (93761 and 93763 are both prime) and the 9048th prime number. Its only divisors are 1 and 93761.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93761: a twin prime (93761 and 93763 are both prime); the 9048th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
93761 is prime, so its only factors are 1 and 93761. It is the 9048th prime; the next prime is 93763 and the one before is 93739.
- 3
The divisors add up to 93762; without 93761 itself that is 1, so 93761 is deficient (1 is less than 93761). Euler's totient φ(93761) = 93760 numbers up to 93761 share no factor with it.
- 4
The digits of 93761 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
93761 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 93762 |
| Euler totient φ(n) | 93760 |
| Square | 8791125121 |
| Cube | 824264682470081 |
| Square root | 306.204180 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.3761 × |
93761 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand seven hundred and sixty-one |
| Binary (base 2) | 10110111001000001 |
| Octal (base 8) | 267101 |
| Hexadecimal (base 16) | 16E41 |
| Base 3 | 11202121122 |
| As time | 93761 seconds = 26 h 2 min 41 s |
Is 93761 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 3) | 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 1) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93761 a prime number?
Yes. 93761 is divisible only by 1 and itself.
What are the factors of 93761?
1, 93761.
What is 93761 in binary?
10110111001000001 (hexadecimal 16E41, octal 267101).
What is the square root of 93761?
About 306.2042.
Is 93761 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 93761?
93761 is a twin prime (93761 and 93763 are both prime); the 9048th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.