The number 91402
91402 is a composite number with 8 divisors. Its prime factorisation is 2 × 23 × 1987. Divisors (8): 1, 2, 23, 46, 1987, 3974, 45701, 91402.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91402 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91402 is composite. Its prime factorisation is
- 3
The divisors add up to 143136; without 91402 itself that is 51734, so 91402 is deficient (51734 is less than 91402). Euler's totient φ(91402) = 43692 numbers up to 91402 share no factor with it.
- 4
The digits of 91402 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91402 = 2 \times 23 \times 1987 \]
91402 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 143136 |
| Euler totient φ(n) | 43692 |
| Square | 8354325604 |
| Cube | 763602068856808 |
| Square root | 302.327637 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1402 × |
91402 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand four hundred and two |
| Binary (base 2) | 10110010100001010 |
| Octal (base 8) | 262412 |
| Hexadecimal (base 16) | 1650A |
| Base 3 | 11122101021 |
| As time | 91402 seconds = 25 h 23 min 22 s |
Is 91402 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91402 ÷ 2 = 45701) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91402 a prime number?
No. 91402 = 2 × 23 × 1987, so it is divisible by 2.
What are the factors of 91402?
1, 2, 23, 46, 1987, 3974, 45701, 91402.
What is 91402 in binary?
10110010100001010 (hexadecimal 1650A, octal 262412).
What is the square root of 91402?
About 302.3276.
Is 91402 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 91402?
It is a composite number with 8 divisors.