The number 91401
91401 is a composite number with 4 divisors. Its prime factorisation is 3 × 30467. Divisors (4): 1, 3, 30467, 91401.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91401: a semiprime: 3 × 30467, the product of two primes.
- 2
91401 is composite. Its prime factorisation is
- 3
The divisors add up to 121872; without 91401 itself that is 30471, so 91401 is deficient (30471 is less than 91401). Euler's totient φ(91401) = 60932 numbers up to 91401 share no factor with it.
- 4
The digits of 91401 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91401 = 3 \times 30467 \]
91401 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 121872 |
| Euler totient φ(n) | 60932 |
| Square | 8354142801 |
| Cube | 763577006154201 |
| Square root | 302.325983 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 195 |
| Scientific notation | 9.1401 × |
91401 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand four hundred and one |
| Binary (base 2) | 10110010100001001 |
| Octal (base 8) | 262411 |
| Hexadecimal (base 16) | 16509 |
| Base 3 | 11122101020 |
| As time | 91401 seconds = 25 h 23 min 21 s |
Is 91401 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 (91401 ÷ 3 = 30467) | 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 1) | 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 | No (remainder 2) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 91401 a prime number?
No. 91401 = 3 × 30467, so it is divisible by 3.
What are the factors of 91401?
1, 3, 30467, 91401.
What is 91401 in binary?
10110010100001001 (hexadecimal 16509, octal 262411).
What is the square root of 91401?
About 302.3260.
Is 91401 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 91401?
91401 is a semiprime: 3 × 30467, the product of two primes.