The number 91293
91293 is a composite number with 4 divisors. Its prime factorisation is 3 × 30431. Divisors (4): 1, 3, 30431, 91293.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91293: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 30431, the product of two primes.
- 2
91293 is composite. Its prime factorisation is
- 3
The divisors add up to 121728; without 91293 itself that is 30435, so 91293 is deficient (30435 is less than 91293). Euler's totient φ(91293) = 60860 numbers up to 91293 share no factor with it.
- 4
The digits of 91293 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91293 = 3 \times 30431 \]
91293 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 121728 |
| Euler totient φ(n) | 60860 |
| Square | 8334411849 |
| Cube | 760873460930757 |
| Square root | 302.147315 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.1293 × |
91293 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and ninety-three |
| Binary (base 2) | 10110010010011101 |
| Octal (base 8) | 262235 |
| Hexadecimal (base 16) | 1649D |
| Base 3 | 11122020020 |
| As time | 91293 seconds = 25 h 21 min 33 s |
Is 91293 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 (91293 ÷ 3 = 30431) | 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 | No (remainder 6) | 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 | No (remainder 6) | 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 4) | 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 91293 a prime number?
No. 91293 = 3 × 30431, so it is divisible by 3.
What are the factors of 91293?
1, 3, 30431, 91293.
What is 91293 in binary?
10110010010011101 (hexadecimal 1649D, octal 262235).
What is the square root of 91293?
About 302.1473.
Is 91293 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 91293?
91293 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 30431, the product of two primes.