The number 5263
5263 is a composite number with 4 divisors. Its prime factorisation is 19 × 277. Divisors (4): 1, 19, 277, 5263.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5263: a semiprime: 19 × 277, the product of two primes.
- 2
5263 is composite. Its prime factorisation is
- 3
The divisors add up to 5560; without 5263 itself that is 297, so 5263 is deficient (297 is less than 5263). Euler's totient φ(5263) = 4968 numbers up to 5263 share no factor with it.
- 4
The digits of 5263 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 191 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5263 = 19 \times 277 \]
5263 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5560 |
| Euler totient φ(n) | 4968 |
| Square | 27699169 |
| Cube | 145780726447 |
| Square root | 72.546537 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 191 |
| Scientific notation | 5.263 × |
5263 in other forms
| Form | Value |
|---|---|
| In words | five thousand two hundred and sixty-three |
| Binary (base 2) | 1010010001111 |
| Octal (base 8) | 12217 |
| Hexadecimal (base 16) | 148F |
| Base 3 | 21012221 |
| As time | 5263 seconds = 1 h 27 min 43 s |
Is 5263 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 6) | 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 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5263 a prime number?
No. 5263 = 19 × 277, so it is divisible by 19.
What are the factors of 5263?
1, 19, 277, 5263.
What is 5263 in binary?
1010010001111 (hexadecimal 148F, octal 12217).
What is the square root of 5263?
About 72.5465.
Is 5263 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5263?
5263 is a semiprime: 19 × 277, the product of two primes.