The number 15052
15052 is a composite number with 12 divisors. Its prime factorisation is × 53 × 71. Divisors (12): 1, 2, 4, 53, 71, 106, 142, 212, 284, 3763, 7526, 15052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15052 is composite. Its prime factorisation is
- 3
The divisors add up to 27216; without 15052 itself that is 12164, so 15052 is deficient (12164 is less than 15052). Euler's totient φ(15052) = 7280 numbers up to 15052 share no factor with it.
- 4
The digits of 15052 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15052 = 2^{2} \times 53 \times 71 \]15052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 27216 |
| Euler totient φ(n) | 7280 |
| Square | 226562704 |
| Cube | 3410221820608 |
| Square root | 122.686593 (= 2√3763) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5052 × |
15052 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and fifty-two |
| Binary (base 2) | 11101011001100 |
| Octal (base 8) | 35314 |
| Hexadecimal (base 16) | 3ACC |
| Base 3 | 202122111 |
| As time | 15052 seconds = 4 h 10 min 52 s |
Is 15052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15052 ÷ 2 = 7526) | 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 (15052 ÷ 4 = 3763) | 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 | No (remainder 2) | 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 4) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15052 a prime number?
No. 15052 = × 53 × 71, so it is divisible by 2.
What are the factors of 15052?
1, 2, 4, 53, 71, 106, 142, 212, 284, 3763, 7526, 15052.
What is 15052 in binary?
11101011001100 (hexadecimal 3ACC, octal 35314).
What is the square root of 15052?
About 122.6866, exactly 2√3763.
Is 15052 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15052?
It is a composite number with 12 divisors.