The number 52663
52663 is a composite number with 4 divisors. Its prime factorisation is 13 × 4051. Divisors (4): 1, 13, 4051, 52663.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52663: a semiprime: 13 × 4051, the product of two primes.
- 2
52663 is composite. Its prime factorisation is
- 3
The divisors add up to 56728; without 52663 itself that is 4065, so 52663 is deficient (4065 is less than 52663). Euler's totient φ(52663) = 48600 numbers up to 52663 share no factor with it.
- 4
The digits of 52663 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52663 = 13 \times 4051 \]
52663 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56728 |
| Euler totient φ(n) | 48600 |
| Square | 2773391569 |
| Cube | 146055120198247 |
| Square root | 229.484204 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.2663 × |
52663 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand six hundred and sixty-three |
| Binary (base 2) | 1100110110110111 |
| Octal (base 8) | 146667 |
| Hexadecimal (base 16) | CDB7 |
| Base 3 | 2200020111 |
| As time | 52663 seconds = 14 h 37 min 43 s |
Is 52663 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 | No (remainder 3) | 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 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 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 52663 a prime number?
No. 52663 = 13 × 4051, so it is divisible by 13.
What are the factors of 52663?
1, 13, 4051, 52663.
What is 52663 in binary?
1100110110110111 (hexadecimal CDB7, octal 146667).
What is the square root of 52663?
About 229.4842.
Is 52663 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 52663?
52663 is a semiprime: 13 × 4051, the product of two primes.