The number 51138
51138 is a composite number with 16 divisors. Its prime factorisation is 2 × × 947. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 54, 947, 1894, 2841, 5682, 8523, 17046, 25569, 51138.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51138: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
51138 is composite. Its prime factorisation is
- 3
The divisors add up to 113760; without 51138 itself that is 62622, so 51138 is abundant (62622 is more than 51138). Euler's totient φ(51138) = 17028 numbers up to 51138 share no factor with it.
- 4
The digits of 51138 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 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51138 = 2 \times 3^{3} \times 947 \]51138 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 113760 |
| Euler totient φ(n) | 17028 |
| Square | 2615095044 |
| Cube | 133730730360072 |
| Square root | 226.137127 (= 3√5682) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1138 × |
51138 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and thirty-eight |
| Binary (base 2) | 1100011111000010 |
| Octal (base 8) | 143702 |
| Hexadecimal (base 16) | C7C2 |
| Base 3 | 2121011000 |
| As time | 51138 seconds = 14 h 12 min 18 s |
Is 51138 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51138 ÷ 2 = 25569) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51138 ÷ 3 = 17046) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51138 ÷ 6 = 8523) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | Yes (51138 ÷ 9 = 5682) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 51138 a prime number?
No. 51138 = 2 × × 947, so it is divisible by 2.
What are the factors of 51138?
1, 2, 3, 6, 9, 18, 27, 54, 947, 1894, 2841, 5682, 8523, 17046, 25569, 51138.
What is 51138 in binary?
1100011111000010 (hexadecimal C7C2, octal 143702).
What is the square root of 51138?
About 226.1371, exactly 3√5682.
Is 51138 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51138?
51138 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.