The number 91230
91230 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 3041. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 3041, 6082, 9123, 15205, 18246, 30410, 45615, 91230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91230: a Harshad number: divisible by its digit sum 15.
- 2
91230 is composite. Its prime factorisation is
- 3
The divisors add up to 219024; without 91230 itself that is 127794, so 91230 is abundant (127794 is more than 91230). Euler's totient φ(91230) = 24320 numbers up to 91230 share no factor with it.
- 4
The digits of 91230 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91230 = 2 \times 3 \times 5 \times 3041 \]
91230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 219024 |
| Euler totient φ(n) | 24320 |
| Square | 8322912900 |
| Cube | 759299343867000 |
| Square root | 302.043043 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.123 × |
91230 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and thirty |
| Binary (base 2) | 10110010001011110 |
| Octal (base 8) | 262136 |
| Hexadecimal (base 16) | 1645E |
| Base 3 | 11122010220 |
| As time | 91230 seconds = 25 h 20 min 30 s |
Is 91230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91230 ÷ 2 = 45615) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91230 ÷ 3 = 30410) | 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 | Yes (91230 ÷ 5 = 18246) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (91230 ÷ 6 = 15205) | 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 6) | 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 | Yes (91230 ÷ 10 = 9123) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91230 a prime number?
No. 91230 = 2 × 3 × 5 × 3041, so it is divisible by 2.
What are the factors of 91230?
1, 2, 3, 5, 6, 10, 15, 30, 3041, 6082, 9123, 15205, 18246, 30410, 45615, 91230.
What is 91230 in binary?
10110010001011110 (hexadecimal 1645E, octal 262136).
What is the square root of 91230?
About 302.0430.
Is 91230 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 91230?
91230 is a Harshad number: divisible by its digit sum 15.