The number 45585
45585 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1013. Divisors (12): 1, 3, 5, 9, 15, 45, 1013, 3039, 5065, 9117, 15195, 45585.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
45585 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
45585 is composite. Its prime factorisation is
- 3
The divisors add up to 79092; without 45585 itself that is 33507, so 45585 is deficient (33507 is less than 45585). Euler's totient φ(45585) = 24288 numbers up to 45585 share no factor with it.
- 4
The digits of 45585 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45585 = 3^{2} \times 5 \times 1013 \]45585 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 79092 |
| Euler totient φ(n) | 24288 |
| Square | 2077992225 |
| Cube | 94725275576625 |
| Square root | 213.506440 (= 3√5065) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.5585 × |
45585 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand five hundred and eighty-five |
| Binary (base 2) | 1011001000010001 |
| Octal (base 8) | 131021 |
| Hexadecimal (base 16) | B211 |
| Base 3 | 2022112100 |
| As time | 45585 seconds = 12 h 39 min 45 s |
Is 45585 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (45585 ÷ 3 = 15195) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (45585 ÷ 5 = 9117) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (45585 ÷ 9 = 5065) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45585 a prime number?
No. 45585 = × 5 × 1013, so it is divisible by 3.
What are the factors of 45585?
1, 3, 5, 9, 15, 45, 1013, 3039, 5065, 9117, 15195, 45585.
What is 45585 in binary?
1011001000010001 (hexadecimal B211, octal 131021).
What is the square root of 45585?
About 213.5064, exactly 3√5065.
Is 45585 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 45585?
It is a composite number with 12 divisors.