The number 45052
45052 is a composite number with 12 divisors. Its prime factorisation is × 7 × 1609. Divisors (12): 1, 2, 4, 7, 14, 28, 1609, 3218, 6436, 11263, 22526, 45052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45052: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
45052 is composite. Its prime factorisation is
- 3
The divisors add up to 90160; without 45052 itself that is 45108, so 45052 is abundant (45108 is more than 45052). Euler's totient φ(45052) = 19296 numbers up to 45052 share no factor with it.
- 4
The digits of 45052 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 207 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45052 = 2^{2} \times 7 \times 1609 \]45052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 90160 |
| Euler totient φ(n) | 19296 |
| Square | 2029682704 |
| Cube | 91441265180608 |
| Square root | 212.254564 (= 2√11263) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 207 |
| Scientific notation | 4.5052 × |
45052 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand and fifty-two |
| Binary (base 2) | 1010111111111100 |
| Octal (base 8) | 127774 |
| Hexadecimal (base 16) | AFFC |
| Base 3 | 2021210121 |
| As time | 45052 seconds = 12 h 30 min 52 s |
Is 45052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (45052 ÷ 2 = 22526) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (45052 ÷ 4 = 11263) | 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (45052 ÷ 7 = 6436) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45052 a prime number?
No. 45052 = × 7 × 1609, so it is divisible by 2.
What are the factors of 45052?
1, 2, 4, 7, 14, 28, 1609, 3218, 6436, 11263, 22526, 45052.
What is 45052 in binary?
1010111111111100 (hexadecimal AFFC, octal 127774).
What is the square root of 45052?
About 212.2546, exactly 2√11263.
Is 45052 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 45052?
45052 is a happy number: repeatedly adding the squares of its digits reaches 1.