The number 51270
51270 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1709. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1709, 3418, 5127, 8545, 10254, 17090, 25635, 51270.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51270: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.
- 2
51270 is composite. Its prime factorisation is
- 3
The divisors add up to 123120; without 51270 itself that is 71850, so 51270 is abundant (71850 is more than 51270). Euler's totient φ(51270) = 13664 numbers up to 51270 share no factor with it.
- 4
The digits of 51270 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51270 = 2 \times 3 \times 5 \times 1709 \]
51270 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 123120 |
| Euler totient φ(n) | 13664 |
| Square | 2628612900 |
| Cube | 134768983383000 |
| Square root | 226.428797 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.127 × |
51270 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and seventy |
| Binary (base 2) | 1100100001000110 |
| Octal (base 8) | 144106 |
| Hexadecimal (base 16) | C846 |
| Base 3 | 2121022220 |
| As time | 51270 seconds = 14 h 14 min 30 s |
Is 51270 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51270 ÷ 2 = 25635) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51270 ÷ 3 = 17090) | 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 (51270 ÷ 5 = 10254) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51270 ÷ 6 = 8545) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51270 ÷ 10 = 5127) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 51270 a prime number?
No. 51270 = 2 × 3 × 5 × 1709, so it is divisible by 2.
What are the factors of 51270?
1, 2, 3, 5, 6, 10, 15, 30, 1709, 3418, 5127, 8545, 10254, 17090, 25635, 51270.
What is 51270 in binary?
1100100001000110 (hexadecimal C846, octal 144106).
What is the square root of 51270?
About 226.4288.
Is 51270 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51270?
51270 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.