The number 51502
51502 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 2341. Divisors (8): 1, 2, 11, 22, 2341, 4682, 25751, 51502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51502 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51502 is composite. Its prime factorisation is
- 3
The divisors add up to 84312; without 51502 itself that is 32810, so 51502 is deficient (32810 is less than 51502). Euler's totient φ(51502) = 23400 numbers up to 51502 share no factor with it.
- 4
The digits of 51502 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51502 = 2 \times 11 \times 2341 \]
51502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 84312 |
| Euler totient φ(n) | 23400 |
| Square | 2652456004 |
| Cube | 136606789118008 |
| Square root | 226.940521 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1502 × |
51502 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and two |
| Binary (base 2) | 1100100100101110 |
| Octal (base 8) | 144456 |
| Hexadecimal (base 16) | C92E |
| Base 3 | 2121122111 |
| As time | 51502 seconds = 14 h 18 min 22 s |
Is 51502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51502 ÷ 2 = 25751) | 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 3) | 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 | Yes (51502 ÷ 11 = 4682) | 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 51502 a prime number?
No. 51502 = 2 × 11 × 2341, so it is divisible by 2.
What are the factors of 51502?
1, 2, 11, 22, 2341, 4682, 25751, 51502.
What is 51502 in binary?
1100100100101110 (hexadecimal C92E, octal 144456).
What is the square root of 51502?
About 226.9405.
Is 51502 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 51502?
It is a composite number with 8 divisors.