The number 51069
51069 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 587. Divisors (8): 1, 3, 29, 87, 587, 1761, 17023, 51069.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51069 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51069 is composite. Its prime factorisation is
- 3
The divisors add up to 70560; without 51069 itself that is 19491, so 51069 is deficient (19491 is less than 51069). Euler's totient φ(51069) = 32816 numbers up to 51069 share no factor with it.
- 4
The digits of 51069 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51069 = 3 \times 29 \times 587 \]
51069 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70560 |
| Euler totient φ(n) | 32816 |
| Square | 2608042761 |
| Cube | 133190135761509 |
| Square root | 225.984513 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1069 × |
51069 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and sixty-nine |
| Binary (base 2) | 1100011101111101 |
| Octal (base 8) | 143575 |
| Hexadecimal (base 16) | C77D |
| Base 3 | 2121001110 |
| As time | 51069 seconds = 14 h 11 min 9 s |
Is 51069 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 (51069 ÷ 3 = 17023) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 7) | 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 51069 a prime number?
No. 51069 = 3 × 29 × 587, so it is divisible by 3.
What are the factors of 51069?
1, 3, 29, 87, 587, 1761, 17023, 51069.
What is 51069 in binary?
1100011101111101 (hexadecimal C77D, octal 143575).
What is the square root of 51069?
About 225.9845.
Is 51069 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51069?
It is a composite number with 8 divisors.