The number 91399
91399 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 1187. Divisors (8): 1, 7, 11, 77, 1187, 8309, 13057, 91399.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91399 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91399 is composite. Its prime factorisation is
- 3
The divisors add up to 114048; without 91399 itself that is 22649, so 91399 is deficient (22649 is less than 91399). Euler's totient φ(91399) = 71160 numbers up to 91399 share no factor with it.
- 4
The digits of 91399 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.
LaTeX source of the formulas on this page
\[ 91399 = 7 \times 11 \times 1187 \]
91399 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 114048 |
| Euler totient φ(n) | 71160 |
| Square | 8353777201 |
| Cube | 763526882394199 |
| Square root | 302.322675 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1399 × |
91399 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and ninety-nine |
| Binary (base 2) | 10110010100000111 |
| Octal (base 8) | 262407 |
| Hexadecimal (base 16) | 16507 |
| Base 3 | 11122101011 |
| As time | 91399 seconds = 25 h 23 min 19 s |
Is 91399 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 4) | 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 (91399 ÷ 7 = 13057) | 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 7) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (91399 ÷ 11 = 8309) | 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 91399 a prime number?
No. 91399 = 7 × 11 × 1187, so it is divisible by 7.
What are the factors of 91399?
1, 7, 11, 77, 1187, 8309, 13057, 91399.
What is 91399 in binary?
10110010100000111 (hexadecimal 16507, octal 262407).
What is the square root of 91399?
About 302.3227.
Is 91399 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 91399?
It is a composite number with 8 divisors.