The number 91396
91396 is a composite number with 12 divisors. Its prime factorisation is × 73 × 313. Divisors (12): 1, 2, 4, 73, 146, 292, 313, 626, 1252, 22849, 45698, 91396.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91396: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
91396 is composite. Its prime factorisation is
- 3
The divisors add up to 162652; without 91396 itself that is 71256, so 91396 is deficient (71256 is less than 91396). Euler's totient φ(91396) = 44928 numbers up to 91396 share no factor with it.
- 4
The digits of 91396 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 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91396 = 2^{2} \times 73 \times 313 \]91396 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 162652 |
| Euler totient φ(n) | 44928 |
| Square | 8353228816 |
| Cube | 763451700867136 |
| Square root | 302.317714 (= 2√22849) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 32 |
| Scientific notation | 9.1396 × |
91396 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and ninety-six |
| Binary (base 2) | 10110010100000100 |
| Octal (base 8) | 262404 |
| Hexadecimal (base 16) | 16504 |
| Base 3 | 11122101001 |
| As time | 91396 seconds = 25 h 23 min 16 s |
Is 91396 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91396 ÷ 2 = 45698) | 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 | Yes (91396 ÷ 4 = 22849) | 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 4) | 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 4) | 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 6) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91396 a prime number?
No. 91396 = × 73 × 313, so it is divisible by 2.
What are the factors of 91396?
1, 2, 4, 73, 146, 292, 313, 626, 1252, 22849, 45698, 91396.
What is 91396 in binary?
10110010100000100 (hexadecimal 16504, octal 262404).
What is the square root of 91396?
About 302.3177, exactly 2√22849.
Is 91396 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 91396?
91396 is a happy number: repeatedly adding the squares of its digits reaches 1.