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