The number 51029
51029 is a composite number with 4 divisors. Its prime factorisation is 11 × 4639. Divisors (4): 1, 11, 4639, 51029.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51029: a semiprime: 11 × 4639, the product of two primes.
- 2
51029 is composite. Its prime factorisation is
- 3
The divisors add up to 55680; without 51029 itself that is 4651, so 51029 is deficient (4651 is less than 51029). Euler's totient φ(51029) = 46380 numbers up to 51029 share no factor with it.
- 4
The digits of 51029 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51029 = 11 \times 4639 \]
51029 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55680 |
| Euler totient φ(n) | 46380 |
| Square | 2603958841 |
| Cube | 132877415697389 |
| Square root | 225.895994 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1029 × |
51029 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and twenty-nine |
| Binary (base 2) | 1100011101010101 |
| Octal (base 8) | 143525 |
| Hexadecimal (base 16) | C755 |
| Base 3 | 2120222222 |
| As time | 51029 seconds = 14 h 10 min 29 s |
Is 51029 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 2) | 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 5) | 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 8) | 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 (51029 ÷ 11 = 4639) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51029 a prime number?
No. 51029 = 11 × 4639, so it is divisible by 11.
What are the factors of 51029?
1, 11, 4639, 51029.
What is 51029 in binary?
1100011101010101 (hexadecimal C755, octal 143525).
What is the square root of 51029?
About 225.8960.
Is 51029 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51029?
51029 is a semiprime: 11 × 4639, the product of two primes.