The number 45522
45522 is a composite number with 20 divisors. Its prime factorisation is 2 × × 281. Divisors (20): 1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 281, 562, 843, 1686, 2529, 5058 … 45522.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45522: a Harshad number: divisible by its digit sum 18.
- 2
45522 is composite. Its prime factorisation is
- 3
The divisors add up to 102366; without 45522 itself that is 56844, so 45522 is abundant (56844 is more than 45522). Euler's totient φ(45522) = 15120 numbers up to 45522 share no factor with it.
- 4
The digits of 45522 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45522 = 2 \times 3^{4} \times 281 \]45522 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 102366 |
| Euler totient φ(n) | 15120 |
| Square | 2072252484 |
| Cube | 94333077576648 |
| Square root | 213.358853 (= 9√562) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.5522 × |
45522 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand five hundred and twenty-two |
| Binary (base 2) | 1011000111010010 |
| Octal (base 8) | 130722 |
| Hexadecimal (base 16) | B1D2 |
| Base 3 | 2022110000 |
| As time | 45522 seconds = 12 h 38 min 42 s |
Is 45522 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (45522 ÷ 2 = 22761) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (45522 ÷ 3 = 15174) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (45522 ÷ 6 = 7587) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (45522 ÷ 9 = 5058) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 45522 a prime number?
No. 45522 = 2 × × 281, so it is divisible by 2.
What are the factors of 45522?
1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 281, 562, 843, 1686, 2529, 5058, 7587, 15174, 22761, 45522.
What is 45522 in binary?
1011000111010010 (hexadecimal B1D2, octal 130722).
What is the square root of 45522?
About 213.3589, exactly 9√562.
Is 45522 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 45522?
45522 is a Harshad number: divisible by its digit sum 18.