The number 53301
53301 is a triangular number: 1 + 2 + … + 326 = 53301. Its prime factorisation is 3 × 109 × 163. Divisors (8): 1, 3, 109, 163, 327, 489, 17767, 53301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53301: a triangular number: 1 + 2 + … + 326 = 53301; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
53301 is composite. Its prime factorisation is
- 3
The divisors add up to 72160; without 53301 itself that is 18859, so 53301 is deficient (18859 is less than 53301). Euler's totient φ(53301) = 34992 numbers up to 53301 share no factor with it.
- 4
The digits of 53301 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53301 = 3 \times 109 \times 163 \]
53301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72160 |
| Euler totient φ(n) | 34992 |
| Square | 2840996601 |
| Cube | 151427959829901 |
| Square root | 230.870093 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.3301 × |
53301 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand three hundred and one |
| Binary (base 2) | 1101000000110101 |
| Octal (base 8) | 150065 |
| Hexadecimal (base 16) | D035 |
| Base 3 | 2201010010 |
| As time | 53301 seconds = 14 h 48 min 21 s |
Is 53301 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 (53301 ÷ 3 = 17767) | 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 1) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 53301 a prime number?
No. 53301 = 3 × 109 × 163, so it is divisible by 3.
What are the factors of 53301?
1, 3, 109, 163, 327, 489, 17767, 53301.
What is 53301 in binary?
1101000000110101 (hexadecimal D035, octal 150065).
What is the square root of 53301?
About 230.8701.
Is 53301 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 53301?
53301 is a triangular number: 1 + 2 + … + 326 = 53301; a happy number: repeatedly adding the squares of its digits reaches 1.