The number 52015
52015 is a composite number with 8 divisors. Its prime factorisation is 5 × 101 × 103. Divisors (8): 1, 5, 101, 103, 505, 515, 10403, 52015.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52015 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52015 is composite. Its prime factorisation is
- 3
The divisors add up to 63648; without 52015 itself that is 11633, so 52015 is deficient (11633 is less than 52015). Euler's totient φ(52015) = 40800 numbers up to 52015 share no factor with it.
- 4
The digits of 52015 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 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52015 = 5 \times 101 \times 103 \]
52015 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 63648 |
| Euler totient φ(n) | 40800 |
| Square | 2705560225 |
| Cube | 140729715103375 |
| Square root | 228.067972 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.2015 × |
52015 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand and fifteen |
| Binary (base 2) | 1100101100101111 |
| Octal (base 8) | 145457 |
| Hexadecimal (base 16) | CB2F |
| Base 3 | 2122100111 |
| As time | 52015 seconds = 14 h 26 min 55 s |
Is 52015 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (52015 ÷ 5 = 10403) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | 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 5) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52015 a prime number?
No. 52015 = 5 × 101 × 103, so it is divisible by 5.
What are the factors of 52015?
1, 5, 101, 103, 505, 515, 10403, 52015.
What is 52015 in binary?
1100101100101111 (hexadecimal CB2F, octal 145457).
What is the square root of 52015?
About 228.0680.
Is 52015 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 52015?
It is a composite number with 8 divisors.