The number 53053
53053 is a composite number with 16 divisors. Its prime factorisation is 7 × 11 × 13 × 53. Divisors (16): 1, 7, 11, 13, 53, 77, 91, 143, 371, 583, 689, 1001, 4081, 4823, 7579, 53053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53053: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
53053 is composite. Its prime factorisation is
- 3
The divisors add up to 72576; without 53053 itself that is 19523, so 53053 is deficient (19523 is less than 53053). Euler's totient φ(53053) = 37440 numbers up to 53053 share no factor with it.
- 4
The digits of 53053 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53053 = 7 \times 11 \times 13 \times 53 \]
53053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 72576 |
| Euler totient φ(n) | 37440 |
| Square | 2814620809 |
| Cube | 149324077779877 |
| Square root | 230.332369 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.3053 × |
53053 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and fifty-three |
| Binary (base 2) | 1100111100111101 |
| Octal (base 8) | 147475 |
| Hexadecimal (base 16) | CF3D |
| Base 3 | 2200202221 |
| As time | 53053 seconds = 14 h 44 min 13 s |
Is 53053 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (53053 ÷ 7 = 7579) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (53053 ÷ 11 = 4823) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53053 a prime number?
No. 53053 = 7 × 11 × 13 × 53, so it is divisible by 7.
What are the factors of 53053?
1, 7, 11, 13, 53, 77, 91, 143, 371, 583, 689, 1001, 4081, 4823, 7579, 53053.
What is 53053 in binary?
1100111100111101 (hexadecimal CF3D, octal 147475).
What is the square root of 53053?
About 230.3324.
Is 53053 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 53053?
53053 is a happy number: repeatedly adding the squares of its digits reaches 1.