The number 91693
91693 is a composite number with 4 divisors. Its prime factorisation is 7 × 13099. Divisors (4): 1, 7, 13099, 91693.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91693: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 13099, the product of two primes.
- 2
91693 is composite. Its prime factorisation is
- 3
The divisors add up to 104800; without 91693 itself that is 13107, so 91693 is deficient (13107 is less than 91693). Euler's totient φ(91693) = 78588 numbers up to 91693 share no factor with it.
- 4
The digits of 91693 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91693 = 7 \times 13099 \]
91693 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 104800 |
| Euler totient φ(n) | 78588 |
| Square | 8407606249 |
| Cube | 770918639789557 |
| Square root | 302.808520 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1693 × |
91693 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand six hundred and ninety-three |
| Binary (base 2) | 10110011000101101 |
| Octal (base 8) | 263055 |
| Hexadecimal (base 16) | 1662D |
| Base 3 | 11122210001 |
| As time | 91693 seconds = 25 h 28 min 13 s |
Is 91693 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 | Yes (91693 ÷ 7 = 13099) | 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 1) | 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 8) | 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 91693 a prime number?
No. 91693 = 7 × 13099, so it is divisible by 7.
What are the factors of 91693?
1, 7, 13099, 91693.
What is 91693 in binary?
10110011000101101 (hexadecimal 1662D, octal 263055).
What is the square root of 91693?
About 302.8085.
Is 91693 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 91693?
91693 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 13099, the product of two primes.