The number 97590
97590 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 3253. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 3253, 6506, 9759, 16265, 19518, 32530, 48795, 97590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 97590: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 30.
- 2
97590 is composite. Its prime factorisation is
- 3
The divisors add up to 234288; without 97590 itself that is 136698, so 97590 is abundant (136698 is more than 97590). Euler's totient φ(97590) = 26016 numbers up to 97590 share no factor with it.
- 4
The digits of 97590 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97590 = 2 \times 3 \times 5 \times 3253 \]
97590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 234288 |
| Euler totient φ(n) | 26016 |
| Square | 9523808100 |
| Cube | 929428432479000 |
| Square root | 312.393982 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.759 × |
97590 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand five hundred and ninety |
| Binary (base 2) | 10111110100110110 |
| Octal (base 8) | 276466 |
| Hexadecimal (base 16) | 17D36 |
| Base 3 | 11221212110 |
| As time | 97590 seconds = 27 h 6 min 30 s |
Is 97590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (97590 ÷ 2 = 48795) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (97590 ÷ 3 = 32530) | 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 (97590 ÷ 5 = 19518) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (97590 ÷ 6 = 16265) | 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 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 (97590 ÷ 10 = 9759) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 97590 a prime number?
No. 97590 = 2 × 3 × 5 × 3253, so it is divisible by 2.
What are the factors of 97590?
1, 2, 3, 5, 6, 10, 15, 30, 3253, 6506, 9759, 16265, 19518, 32530, 48795, 97590.
What is 97590 in binary?
10111110100110110 (hexadecimal 17D36, octal 276466).
What is the square root of 97590?
About 312.3940.
Is 97590 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 97590?
97590 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 30.