The number 51231
51231 is a composite number with 4 divisors. Its prime factorisation is 3 × 17077. Divisors (4): 1, 3, 17077, 51231.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51231: a semiprime: 3 × 17077, the product of two primes.
- 2
51231 is composite. Its prime factorisation is
- 3
The divisors add up to 68312; without 51231 itself that is 17081, so 51231 is deficient (17081 is less than 51231). Euler's totient φ(51231) = 34152 numbers up to 51231 share no factor with it.
- 4
The digits of 51231 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51231 = 3 \times 17077 \]
51231 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68312 |
| Euler totient φ(n) | 34152 |
| Square | 2624615361 |
| Cube | 134461669559391 |
| Square root | 226.342661 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1231 × |
51231 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and thirty-one |
| Binary (base 2) | 1100100000011111 |
| Octal (base 8) | 144037 |
| Hexadecimal (base 16) | C81F |
| Base 3 | 2121021110 |
| As time | 51231 seconds = 14 h 13 min 51 s |
Is 51231 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 (51231 ÷ 3 = 17077) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 5) | 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 7) | 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 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51231 a prime number?
No. 51231 = 3 × 17077, so it is divisible by 3.
What are the factors of 51231?
1, 3, 17077, 51231.
What is 51231 in binary?
1100100000011111 (hexadecimal C81F, octal 144037).
What is the square root of 51231?
About 226.3427.
Is 51231 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51231?
51231 is a semiprime: 3 × 17077, the product of two primes.