The number 91413
91413 is a composite number with 12 divisors. Its prime factorisation is × 7 × 1451. Divisors (12): 1, 3, 7, 9, 21, 63, 1451, 4353, 10157, 13059, 30471, 91413.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91413 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91413 is composite. Its prime factorisation is
- 3
The divisors add up to 151008; without 91413 itself that is 59595, so 91413 is deficient (59595 is less than 91413). Euler's totient φ(91413) = 52200 numbers up to 91413 share no factor with it.
- 4
The digits of 91413 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91413 = 3^{2} \times 7 \times 1451 \]91413 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 151008 |
| Euler totient φ(n) | 52200 |
| Square | 8356336569 |
| Cube | 763877794781997 |
| Square root | 302.345828 (= 3√10157) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1413 × |
91413 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand four hundred and thirteen |
| Binary (base 2) | 10110010100010101 |
| Octal (base 8) | 262425 |
| Hexadecimal (base 16) | 16515 |
| Base 3 | 11122101200 |
| As time | 91413 seconds = 25 h 23 min 33 s |
Is 91413 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 | Yes (91413 ÷ 3 = 30471) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91413 ÷ 7 = 13059) | 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 | Yes (91413 ÷ 9 = 10157) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91413 a prime number?
No. 91413 = × 7 × 1451, so it is divisible by 3.
What are the factors of 91413?
1, 3, 7, 9, 21, 63, 1451, 4353, 10157, 13059, 30471, 91413.
What is 91413 in binary?
10110010100010101 (hexadecimal 16515, octal 262425).
What is the square root of 91413?
About 302.3458, exactly 3√10157.
Is 91413 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 91413?
It is a composite number with 12 divisors.