The number 94693
94693 is the 9131st prime number. Its only divisors are 1 and 94693.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94693: the 9131st prime number.
- 2
94693 is prime, so its only factors are 1 and 94693. It is the 9131st prime; the next prime is 94709 and the one before is 94687.
- 3
The divisors add up to 94694; without 94693 itself that is 1, so 94693 is deficient (1 is less than 94693). Euler's totient φ(94693) = 94692 numbers up to 94693 share no factor with it.
- 4
The digits of 94693 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
94693 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 94694 |
| Euler totient φ(n) | 94692 |
| Square | 8966764249 |
| Cube | 849089807030557 |
| Square root | 307.722277 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.4693 × |
94693 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand six hundred and ninety-three |
| Binary (base 2) | 10111000111100101 |
| Octal (base 8) | 270745 |
| Hexadecimal (base 16) | 171E5 |
| Base 3 | 11210220011 |
| As time | 94693 seconds = 26 h 18 min 13 s |
Is 94693 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 3) | 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 4) | 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 3) | 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 94693 a prime number?
Yes. 94693 is divisible only by 1 and itself.
What are the factors of 94693?
1, 94693.
What is 94693 in binary?
10111000111100101 (hexadecimal 171E5, octal 270745).
What is the square root of 94693?
About 307.7223.
Is 94693 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 94693?
94693 is the 9131st prime number.