The number 91970
91970 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 17 × 541. Divisors (16): 1, 2, 5, 10, 17, 34, 85, 170, 541, 1082, 2705, 5410, 9197, 18394, 45985, 91970.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91970 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91970 is composite. Its prime factorisation is
- 3
The divisors add up to 175608; without 91970 itself that is 83638, so 91970 is deficient (83638 is less than 91970). Euler's totient φ(91970) = 34560 numbers up to 91970 share no factor with it.
- 4
The digits of 91970 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91970 = 2 \times 5 \times 17 \times 541 \]
91970 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 175608 |
| Euler totient φ(n) | 34560 |
| Square | 8458480900 |
| Cube | 777926488373000 |
| Square root | 303.265560 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.197 × |
91970 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and seventy |
| Binary (base 2) | 10110011101000010 |
| Octal (base 8) | 263502 |
| Hexadecimal (base 16) | 16742 |
| Base 3 | 11200011022 |
| As time | 91970 seconds = 25 h 32 min 50 s |
Is 91970 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91970 ÷ 2 = 45985) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (91970 ÷ 5 = 18394) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (91970 ÷ 10 = 9197) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91970 a prime number?
No. 91970 = 2 × 5 × 17 × 541, so it is divisible by 2.
What are the factors of 91970?
1, 2, 5, 10, 17, 34, 85, 170, 541, 1082, 2705, 5410, 9197, 18394, 45985, 91970.
What is 91970 in binary?
10110011101000010 (hexadecimal 16742, octal 263502).
What is the square root of 91970?
About 303.2656.
Is 91970 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 91970?
It is a composite number with 16 divisors.