The number 5063
5063 is a composite number with 4 divisors. Its prime factorisation is 61 × 83. Divisors (4): 1, 61, 83, 5063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5063: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 83, the product of two primes.
- 2
5063 is composite. Its prime factorisation is
- 3
The divisors add up to 5208; without 5063 itself that is 145, so 5063 is deficient (145 is less than 5063). Euler's totient φ(5063) = 4920 numbers up to 5063 share no factor with it.
- 4
The digits of 5063 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5063 = 61 \times 83 \]
5063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5208 |
| Euler totient φ(n) | 4920 |
| Square | 25633969 |
| Cube | 129784785047 |
| Square root | 71.154761 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 134 |
| Scientific notation | 5.063 × |
5063 in other forms
| Form | Value |
|---|---|
| In words | five thousand and sixty-three |
| Binary (base 2) | 1001111000111 |
| Octal (base 8) | 11707 |
| Hexadecimal (base 16) | 13C7 |
| Base 3 | 20221112 |
| As time | 5063 seconds = 1 h 24 min 23 s |
Is 5063 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 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 5) | 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 5) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5063 a prime number?
No. 5063 = 61 × 83, so it is divisible by 61.
What are the factors of 5063?
1, 61, 83, 5063.
What is 5063 in binary?
1001111000111 (hexadecimal 13C7, octal 11707).
What is the square root of 5063?
About 71.1548.
Is 5063 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 5063?
5063 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 83, the product of two primes.