The number 28502
28502 is a composite number with 4 divisors. Its prime factorisation is 2 × 14251. Divisors (4): 1, 2, 14251, 28502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 28502: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 14251, the product of two primes.
- 2
28502 is composite. Its prime factorisation is
- 3
The divisors add up to 42756; without 28502 itself that is 14254, so 28502 is deficient (14254 is less than 28502). Euler's totient φ(28502) = 14250 numbers up to 28502 share no factor with it.
- 4
The digits of 28502 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 51 steps to reach 1.
LaTeX source of the formulas on this page
\[ 28502 = 2 \times 14251 \]
28502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42756 |
| Euler totient φ(n) | 14250 |
| Square | 812364004 |
| Cube | 23153998842008 |
| Square root | 168.825354 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 51 |
| Scientific notation | 2.8502 × |
28502 in other forms
| Form | Value |
|---|---|
| In words | twenty-eight thousand five hundred and two |
| Binary (base 2) | 110111101010110 |
| Octal (base 8) | 67526 |
| Hexadecimal (base 16) | 6F56 |
| Base 3 | 1110002122 |
| As time | 28502 seconds = 7 h 55 min 2 s |
Is 28502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (28502 ÷ 2 = 14251) | 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 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 28502 a prime number?
No. 28502 = 2 × 14251, so it is divisible by 2.
What are the factors of 28502?
1, 2, 14251, 28502.
What is 28502 in binary?
110111101010110 (hexadecimal 6F56, octal 67526).
What is the square root of 28502?
About 168.8254.
Is 28502 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 28502?
28502 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 14251, the product of two primes.