The number 52013
52013 is a composite number with 4 divisors. Its prime factorisation is 13 × 4001. Divisors (4): 1, 13, 4001, 52013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52013: a semiprime: 13 × 4001, the product of two primes.
- 2
52013 is composite. Its prime factorisation is
- 3
The divisors add up to 56028; without 52013 itself that is 4015, so 52013 is deficient (4015 is less than 52013). Euler's totient φ(52013) = 48000 numbers up to 52013 share no factor with it.
- 4
The digits of 52013 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52013 = 13 \times 4001 \]
52013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56028 |
| Euler totient φ(n) | 48000 |
| Square | 2705352169 |
| Cube | 140713482366197 |
| Square root | 228.063588 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.2013 × |
52013 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand and thirteen |
| Binary (base 2) | 1100101100101101 |
| Octal (base 8) | 145455 |
| Hexadecimal (base 16) | CB2D |
| Base 3 | 2122100102 |
| As time | 52013 seconds = 14 h 26 min 53 s |
Is 52013 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 2) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52013 a prime number?
No. 52013 = 13 × 4001, so it is divisible by 13.
What are the factors of 52013?
1, 13, 4001, 52013.
What is 52013 in binary?
1100101100101101 (hexadecimal CB2D, octal 145455).
What is the square root of 52013?
About 228.0636.
Is 52013 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 52013?
52013 is a semiprime: 13 × 4001, the product of two primes.