The number 51249
51249 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1553. Divisors (8): 1, 3, 11, 33, 1553, 4659, 17083, 51249.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51249 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51249 is composite. Its prime factorisation is
- 3
The divisors add up to 74592; without 51249 itself that is 23343, so 51249 is deficient (23343 is less than 51249). Euler's totient φ(51249) = 31040 numbers up to 51249 share no factor with it.
- 4
The digits of 51249 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51249 = 3 \times 11 \times 1553 \]
51249 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74592 |
| Euler totient φ(n) | 31040 |
| Square | 2626460001 |
| Cube | 134603448591249 |
| Square root | 226.382420 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1249 × |
51249 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and forty-nine |
| Binary (base 2) | 1100100000110001 |
| Octal (base 8) | 144061 |
| Hexadecimal (base 16) | C831 |
| Base 3 | 2121022010 |
| As time | 51249 seconds = 14 h 14 min 9 s |
Is 51249 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 | Yes (51249 ÷ 3 = 17083) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (51249 ÷ 11 = 4659) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51249 a prime number?
No. 51249 = 3 × 11 × 1553, so it is divisible by 3.
What are the factors of 51249?
1, 3, 11, 33, 1553, 4659, 17083, 51249.
What is 51249 in binary?
1100100000110001 (hexadecimal C831, octal 144061).
What is the square root of 51249?
About 226.3824.
Is 51249 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51249?
It is a composite number with 8 divisors.