The number 5053
5053 is a composite number with 4 divisors. Its prime factorisation is 31 × 163. Divisors (4): 1, 31, 163, 5053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5053: a semiprime: 31 × 163, the product of two primes.
- 2
5053 is composite. Its prime factorisation is
- 3
The divisors add up to 5248; without 5053 itself that is 195, so 5053 is deficient (195 is less than 5053). Euler's totient φ(5053) = 4860 numbers up to 5053 share no factor with it.
- 4
The digits of 5053 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 178 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5053 = 31 \times 163 \]
5053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5248 |
| Euler totient φ(n) | 4860 |
| Square | 25532809 |
| Cube | 129017283877 |
| Square root | 71.084457 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 178 |
| Scientific notation | 5.053 × |
5053 in other forms
| Form | Value |
|---|---|
| In words | five thousand and fifty-three |
| Binary (base 2) | 1001110111101 |
| Octal (base 8) | 11675 |
| Hexadecimal (base 16) | 13BD |
| Base 3 | 20221011 |
| As time | 5053 seconds = 1 h 24 min 13 s |
Is 5053 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 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 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 5) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5053 a prime number?
No. 5053 = 31 × 163, so it is divisible by 31.
What are the factors of 5053?
1, 31, 163, 5053.
What is 5053 in binary?
1001110111101 (hexadecimal 13BD, octal 11675).
What is the square root of 5053?
About 71.0845.
Is 5053 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 5053?
5053 is a semiprime: 31 × 163, the product of two primes.