The number 57502
57502 is a composite number with 4 divisors. Its prime factorisation is 2 × 28751. Divisors (4): 1, 2, 28751, 57502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57502: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 28751, the product of two primes.
- 2
57502 is composite. Its prime factorisation is
- 3
The divisors add up to 86256; without 57502 itself that is 28754, so 57502 is deficient (28754 is less than 57502). Euler's totient φ(57502) = 28750 numbers up to 57502 share no factor with it.
- 4
The digits of 57502 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57502 = 2 \times 28751 \]
57502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 86256 |
| Euler totient φ(n) | 28750 |
| Square | 3306480004 |
| Cube | 190129213190008 |
| Square root | 239.795746 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.7502 × |
57502 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand five hundred and two |
| Binary (base 2) | 1110000010011110 |
| Octal (base 8) | 160236 |
| Hexadecimal (base 16) | E09E |
| Base 3 | 2220212201 |
| As time | 57502 seconds = 15 h 58 min 22 s |
Is 57502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57502 ÷ 2 = 28751) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 5) | 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 57502 a prime number?
No. 57502 = 2 × 28751, so it is divisible by 2.
What are the factors of 57502?
1, 2, 28751, 57502.
What is 57502 in binary?
1110000010011110 (hexadecimal E09E, octal 160236).
What is the square root of 57502?
About 239.7957.
Is 57502 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 57502?
57502 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 28751, the product of two primes.