The number 91409
91409 is a composite number with 8 divisors. Its prime factorisation is 17 × 19 × 283. Divisors (8): 1, 17, 19, 283, 323, 4811, 5377, 91409.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91409 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91409 is composite. Its prime factorisation is
- 3
The divisors add up to 102240; without 91409 itself that is 10831, so 91409 is deficient (10831 is less than 91409). Euler's totient φ(91409) = 81216 numbers up to 91409 share no factor with it.
- 4
The digits of 91409 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91409 = 17 \times 19 \times 283 \]
91409 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102240 |
| Euler totient φ(n) | 81216 |
| Square | 8355605281 |
| Cube | 763777523130929 |
| Square root | 302.339213 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1409 × |
91409 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand four hundred and nine |
| Binary (base 2) | 10110010100010001 |
| Octal (base 8) | 262421 |
| Hexadecimal (base 16) | 16511 |
| Base 3 | 11122101112 |
| As time | 91409 seconds = 25 h 23 min 29 s |
Is 91409 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 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91409 a prime number?
No. 91409 = 17 × 19 × 283, so it is divisible by 17.
What are the factors of 91409?
1, 17, 19, 283, 323, 4811, 5377, 91409.
What is 91409 in binary?
10110010100010001 (hexadecimal 16511, octal 262421).
What is the square root of 91409?
About 302.3392.
Is 91409 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 91409?
It is a composite number with 8 divisors.