The number 93691
93691 is a composite number with 4 divisors. Its prime factorisation is 13 × 7207. Divisors (4): 1, 13, 7207, 93691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93691: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 7207, the product of two primes.
- 2
93691 is composite. Its prime factorisation is
- 3
The divisors add up to 100912; without 93691 itself that is 7221, so 93691 is deficient (7221 is less than 93691). Euler's totient φ(93691) = 86472 numbers up to 93691 share no factor with it.
- 4
The digits of 93691 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93691 = 13 \times 7207 \]
93691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 100912 |
| Euler totient φ(n) | 86472 |
| Square | 8778003481 |
| Cube | 822419924138371 |
| Square root | 306.089856 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.3691 × |
93691 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and ninety-one |
| Binary (base 2) | 10110110111111011 |
| Octal (base 8) | 266773 |
| Hexadecimal (base 16) | 16DFB |
| Base 3 | 11202112001 |
| As time | 93691 seconds = 26 h 1 min 31 s |
Is 93691 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 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93691 a prime number?
No. 93691 = 13 × 7207, so it is divisible by 13.
What are the factors of 93691?
1, 13, 7207, 93691.
What is 93691 in binary?
10110110111111011 (hexadecimal 16DFB, octal 266773).
What is the square root of 93691?
About 306.0899.
Is 93691 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 93691?
93691 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 7207, the product of two primes.