The number 91470
91470 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 3049. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 3049, 6098, 9147, 15245, 18294, 30490, 45735, 91470.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91470 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91470 is composite. Its prime factorisation is
- 3
The divisors add up to 219600; without 91470 itself that is 128130, so 91470 is abundant (128130 is more than 91470). Euler's totient φ(91470) = 24384 numbers up to 91470 share no factor with it.
- 4
The digits of 91470 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91470 = 2 \times 3 \times 5 \times 3049 \]
91470 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 219600 |
| Euler totient φ(n) | 24384 |
| Square | 8366760900 |
| Cube | 765307619523000 |
| Square root | 302.440077 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 120 |
| Scientific notation | 9.147 × |
91470 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand four hundred and seventy |
| Binary (base 2) | 10110010101001110 |
| Octal (base 8) | 262516 |
| Hexadecimal (base 16) | 1654E |
| Base 3 | 11122110210 |
| As time | 91470 seconds = 25 h 24 min 30 s |
Is 91470 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91470 ÷ 2 = 45735) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91470 ÷ 3 = 30490) | 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 (91470 ÷ 5 = 18294) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (91470 ÷ 6 = 15245) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (91470 ÷ 10 = 9147) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 91470 a prime number?
No. 91470 = 2 × 3 × 5 × 3049, so it is divisible by 2.
What are the factors of 91470?
1, 2, 3, 5, 6, 10, 15, 30, 3049, 6098, 9147, 15245, 18294, 30490, 45735, 91470.
What is 91470 in binary?
10110010101001110 (hexadecimal 1654E, octal 262516).
What is the square root of 91470?
About 302.4401.
Is 91470 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 91470?
It is a composite number with 16 divisors.