The number 53066
53066 is a composite number with 12 divisors. Its prime factorisation is 2 × × 157. Divisors (12): 1, 2, 13, 26, 157, 169, 314, 338, 2041, 4082, 26533, 53066.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53066 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53066 is composite. Its prime factorisation is
- 3
The divisors add up to 86742; without 53066 itself that is 33676, so 53066 is deficient (33676 is less than 53066). Euler's totient φ(53066) = 24336 numbers up to 53066 share no factor with it.
- 4
The digits of 53066 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53066 = 2 \times 13^{2} \times 157 \]53066 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 86742 |
| Euler totient φ(n) | 24336 |
| Square | 2816000356 |
| Cube | 149433874891496 |
| Square root | 230.360587 (= 13√314) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3066 × |
53066 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and sixty-six |
| Binary (base 2) | 1100111101001010 |
| Octal (base 8) | 147512 |
| Hexadecimal (base 16) | CF4A |
| Base 3 | 2200210102 |
| As time | 53066 seconds = 14 h 44 min 26 s |
Is 53066 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53066 ÷ 2 = 26533) | 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 2) | 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53066 a prime number?
No. 53066 = 2 × × 157, so it is divisible by 2.
What are the factors of 53066?
1, 2, 13, 26, 157, 169, 314, 338, 2041, 4082, 26533, 53066.
What is 53066 in binary?
1100111101001010 (hexadecimal CF4A, octal 147512).
What is the square root of 53066?
About 230.3606, exactly 13√314.
Is 53066 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 53066?
It is a composite number with 12 divisors.