The number 51330
51330 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 29 × 59. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 29, 30, 58, 59, 87, 118, 145, 174, 177 … 51330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51330: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51330 is composite. Its prime factorisation is
- 3
The divisors add up to 129600; without 51330 itself that is 78270, so 51330 is abundant (78270 is more than 51330). Euler's totient φ(51330) = 12992 numbers up to 51330 share no factor with it.
- 4
The digits of 51330 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51330 = 2 \times 3 \times 5 \times 29 \times 59 \]
51330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 129600 |
| Euler totient φ(n) | 12992 |
| Square | 2634768900 |
| Cube | 135242687637000 |
| Square root | 226.561250 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.133 × |
51330 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and thirty |
| Binary (base 2) | 1100100010000010 |
| Octal (base 8) | 144202 |
| Hexadecimal (base 16) | C882 |
| Base 3 | 2121102010 |
| As time | 51330 seconds = 14 h 15 min 30 s |
Is 51330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51330 ÷ 2 = 25665) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51330 ÷ 3 = 17110) | 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 | Yes (51330 ÷ 5 = 10266) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51330 ÷ 6 = 8555) | 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 2) | 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 | Yes (51330 ÷ 10 = 5133) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51330 a prime number?
No. 51330 = 2 × 3 × 5 × 29 × 59, so it is divisible by 2.
What are the factors of 51330?
1, 2, 3, 5, 6, 10, 15, 29, 30, 58, 59, 87, 118, 145, 174, 177, 290, 295, 354, 435, 590, 870, 885, 1711, 1770, 3422, 5133, 8555, 10266, 17110, 25665, 51330.
What is 51330 in binary?
1100100010000010 (hexadecimal C882, octal 144202).
What is the square root of 51330?
About 226.5612.
Is 51330 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51330?
51330 is a happy number: repeatedly adding the squares of its digits reaches 1.