The number 51253
51253 is a composite number with 4 divisors. Its prime factorisation is 107 × 479. Divisors (4): 1, 107, 479, 51253.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51253: a semiprime: 107 × 479, the product of two primes.
- 2
51253 is composite. Its prime factorisation is
- 3
The divisors add up to 51840; without 51253 itself that is 587, so 51253 is deficient (587 is less than 51253). Euler's totient φ(51253) = 50668 numbers up to 51253 share no factor with it.
- 4
The digits of 51253 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51253 = 107 \times 479 \]
51253 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51840 |
| Euler totient φ(n) | 50668 |
| Square | 2626870009 |
| Cube | 134634968571277 |
| Square root | 226.391254 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1253 × |
51253 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and fifty-three |
| Binary (base 2) | 1100100000110101 |
| Octal (base 8) | 144065 |
| Hexadecimal (base 16) | C835 |
| Base 3 | 2121022021 |
| As time | 51253 seconds = 14 h 14 min 13 s |
Is 51253 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 1) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51253 a prime number?
No. 51253 = 107 × 479, so it is divisible by 107.
What are the factors of 51253?
1, 107, 479, 51253.
What is 51253 in binary?
1100100000110101 (hexadecimal C835, octal 144065).
What is the square root of 51253?
About 226.3913.
Is 51253 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51253?
51253 is a semiprime: 107 × 479, the product of two primes.