The number 51269
51269 is a composite number with 4 divisors. Its prime factorisation is 167 × 307. Divisors (4): 1, 167, 307, 51269.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51269: a semiprime: 167 × 307, the product of two primes.
- 2
51269 is composite. Its prime factorisation is
- 3
The divisors add up to 51744; without 51269 itself that is 475, so 51269 is deficient (475 is less than 51269). Euler's totient φ(51269) = 50796 numbers up to 51269 share no factor with it.
- 4
The digits of 51269 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51269 = 167 \times 307 \]
51269 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51744 |
| Euler totient φ(n) | 50796 |
| Square | 2628510361 |
| Cube | 134761097698109 |
| Square root | 226.426589 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1269 × |
51269 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and sixty-nine |
| Binary (base 2) | 1100100001000101 |
| Octal (base 8) | 144105 |
| Hexadecimal (base 16) | C845 |
| Base 3 | 2121022212 |
| As time | 51269 seconds = 14 h 14 min 29 s |
Is 51269 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 | No (remainder 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51269 a prime number?
No. 51269 = 167 × 307, so it is divisible by 167.
What are the factors of 51269?
1, 167, 307, 51269.
What is 51269 in binary?
1100100001000101 (hexadecimal C845, octal 144105).
What is the square root of 51269?
About 226.4266.
Is 51269 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 51269?
51269 is a semiprime: 167 × 307, the product of two primes.