The number 61590
61590 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2053. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2053, 4106, 6159, 10265, 12318, 20530, 30795, 61590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61590 is composite. Its prime factorisation is
- 3
The divisors add up to 147888; without 61590 itself that is 86298, so 61590 is abundant (86298 is more than 61590). Euler's totient φ(61590) = 16416 numbers up to 61590 share no factor with it.
- 4
The digits of 61590 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61590 = 2 \times 3 \times 5 \times 2053 \]
61590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 147888 |
| Euler totient φ(n) | 16416 |
| Square | 3793328100 |
| Cube | 233631077679000 |
| Square root | 248.173327 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.159 × |
61590 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and ninety |
| Binary (base 2) | 1111000010010110 |
| Octal (base 8) | 170226 |
| Hexadecimal (base 16) | F096 |
| Base 3 | 10010111010 |
| As time | 61590 seconds = 17 h 6 min 30 s |
Is 61590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61590 ÷ 2 = 30795) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (61590 ÷ 3 = 20530) | 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 (61590 ÷ 5 = 12318) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (61590 ÷ 6 = 10265) | 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 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 (61590 ÷ 10 = 6159) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 61590 a prime number?
No. 61590 = 2 × 3 × 5 × 2053, so it is divisible by 2.
What are the factors of 61590?
1, 2, 3, 5, 6, 10, 15, 30, 2053, 4106, 6159, 10265, 12318, 20530, 30795, 61590.
What is 61590 in binary?
1111000010010110 (hexadecimal F096, octal 170226).
What is the square root of 61590?
About 248.1733.
Is 61590 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 61590?
It is a composite number with 16 divisors.