The number 52483
52483 is a composite number with 4 divisors. Its prime factorisation is 31 × 1693. Divisors (4): 1, 31, 1693, 52483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52483: a semiprime: 31 × 1693, the product of two primes.
- 2
52483 is composite. Its prime factorisation is
- 3
The divisors add up to 54208; without 52483 itself that is 1725, so 52483 is deficient (1725 is less than 52483). Euler's totient φ(52483) = 50760 numbers up to 52483 share no factor with it.
- 4
The digits of 52483 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52483 = 31 \times 1693 \]
52483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54208 |
| Euler totient φ(n) | 50760 |
| Square | 2754465289 |
| Cube | 144562601762587 |
| Square root | 229.091685 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.2483 × |
52483 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand four hundred and eighty-three |
| Binary (base 2) | 1100110100000011 |
| Octal (base 8) | 146403 |
| Hexadecimal (base 16) | CD03 |
| Base 3 | 2122222211 |
| As time | 52483 seconds = 14 h 34 min 43 s |
Is 52483 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 4) | 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 3) | 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 2) | 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 52483 a prime number?
No. 52483 = 31 × 1693, so it is divisible by 31.
What are the factors of 52483?
1, 31, 1693, 52483.
What is 52483 in binary?
1100110100000011 (hexadecimal CD03, octal 146403).
What is the square root of 52483?
About 229.0917.
Is 52483 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 52483?
52483 is a semiprime: 31 × 1693, the product of two primes.