The number 6502
6502 is a composite number with 4 divisors. Its prime factorisation is 2 × 3251. Divisors (4): 1, 2, 3251, 6502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6502: a semiprime: 2 × 3251, the product of two primes.
- 2
6502 is composite. Its prime factorisation is
- 3
The divisors add up to 9756; without 6502 itself that is 3254, so 6502 is deficient (3254 is less than 6502). Euler's totient φ(6502) = 3250 numbers up to 6502 share no factor with it.
- 4
The digits of 6502 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 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6502 = 2 \times 3251 \]
6502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9756 |
| Euler totient φ(n) | 3250 |
| Square | 42276004 |
| Cube | 274878578008 |
| Square root | 80.634980 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 137 |
| Scientific notation | 6.502 × |
6502 in other forms
| Form | Value |
|---|---|
| In words | six thousand five hundred and two |
| Binary (base 2) | 1100101100110 |
| Octal (base 8) | 14546 |
| Hexadecimal (base 16) | 1966 |
| Base 3 | 22220211 |
| As time | 6502 seconds = 1 h 48 min 22 s |
Is 6502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6502 ÷ 2 = 3251) | 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 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 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 1) | 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 6502 a prime number?
No. 6502 = 2 × 3251, so it is divisible by 2.
What are the factors of 6502?
1, 2, 3251, 6502.
What is 6502 in binary?
1100101100110 (hexadecimal 1966, octal 14546).
What is the square root of 6502?
About 80.6350.
Is 6502 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 6502?
6502 is a semiprime: 2 × 3251, the product of two primes.