The number 5062
5062 is a composite number with 4 divisors. Its prime factorisation is 2 × 2531. Divisors (4): 1, 2, 2531, 5062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5062: a semiprime: 2 × 2531, the product of two primes.
- 2
5062 is composite. Its prime factorisation is
- 3
The divisors add up to 7596; without 5062 itself that is 2534, so 5062 is deficient (2534 is less than 5062). Euler's totient φ(5062) = 2530 numbers up to 5062 share no factor with it.
- 4
The digits of 5062 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5062 = 2 \times 2531 \]
5062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7596 |
| Euler totient φ(n) | 2530 |
| Square | 25623844 |
| Cube | 129707898328 |
| Square root | 71.147734 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 41 |
| Scientific notation | 5.062 × |
5062 in other forms
| Form | Value |
|---|---|
| In words | five thousand and sixty-two |
| Binary (base 2) | 1001111000110 |
| Octal (base 8) | 11706 |
| Hexadecimal (base 16) | 13C6 |
| Base 3 | 20221111 |
| As time | 5062 seconds = 1 h 24 min 22 s |
Is 5062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5062 ÷ 2 = 2531) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5062 a prime number?
No. 5062 = 2 × 2531, so it is divisible by 2.
What are the factors of 5062?
1, 2, 2531, 5062.
What is 5062 in binary?
1001111000110 (hexadecimal 13C6, octal 11706).
What is the square root of 5062?
About 71.1477.
Is 5062 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 5062?
5062 is a semiprime: 2 × 2531, the product of two primes.