The number 51057
51057 is a composite number with 16 divisors. Its prime factorisation is × 31 × 61. Divisors (16): 1, 3, 9, 27, 31, 61, 93, 183, 279, 549, 837, 1647, 1891, 5673, 17019, 51057.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51057: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51057 is composite. Its prime factorisation is
- 3
The divisors add up to 79360; without 51057 itself that is 28303, so 51057 is deficient (28303 is less than 51057). Euler's totient φ(51057) = 32400 numbers up to 51057 share no factor with it.
- 4
The digits of 51057 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51057 = 3^{3} \times 31 \times 61 \]51057 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 79360 |
| Euler totient φ(n) | 32400 |
| Square | 2606817249 |
| Cube | 133096268282193 |
| Square root | 225.957961 (= 3√5673) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1057 × |
51057 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and fifty-seven |
| Binary (base 2) | 1100011101110001 |
| Octal (base 8) | 143561 |
| Hexadecimal (base 16) | C771 |
| Base 3 | 2121001000 |
| As time | 51057 seconds = 14 h 10 min 57 s |
Is 51057 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 (51057 ÷ 3 = 17019) | 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 2) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (51057 ÷ 9 = 5673) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 51057 a prime number?
No. 51057 = × 31 × 61, so it is divisible by 3.
What are the factors of 51057?
1, 3, 9, 27, 31, 61, 93, 183, 279, 549, 837, 1647, 1891, 5673, 17019, 51057.
What is 51057 in binary?
1100011101110001 (hexadecimal C771, octal 143561).
What is the square root of 51057?
About 225.9580, exactly 3√5673.
Is 51057 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51057?
51057 is a happy number: repeatedly adding the squares of its digits reaches 1.