The number 53072
53072 is a composite number with 20 divisors. Its prime factorisation is × 31 × 107. Divisors (20): 1, 2, 4, 8, 16, 31, 62, 107, 124, 214, 248, 428, 496, 856, 1712, 3317 … 53072.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53072 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53072 is composite. Its prime factorisation is
- 3
The divisors add up to 107136; without 53072 itself that is 54064, so 53072 is abundant (54064 is more than 53072). Euler's totient φ(53072) = 25440 numbers up to 53072 share no factor with it.
- 4
The digits of 53072 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53072 = 2^{4} \times 31 \times 107 \]53072 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 107136 |
| Euler totient φ(n) | 25440 |
| Square | 2816637184 |
| Cube | 149484568629248 |
| Square root | 230.373610 (= 4√3317) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3072 × |
53072 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and seventy-two |
| Binary (base 2) | 1100111101010000 |
| Octal (base 8) | 147520 |
| Hexadecimal (base 16) | CF50 |
| Base 3 | 2200210122 |
| As time | 53072 seconds = 14 h 44 min 32 s |
Is 53072 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53072 ÷ 2 = 26536) | 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 | Yes (53072 ÷ 4 = 13268) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 5) | 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 | Yes (53072 ÷ 8 = 6634) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53072 a prime number?
No. 53072 = × 31 × 107, so it is divisible by 2.
What are the factors of 53072?
1, 2, 4, 8, 16, 31, 62, 107, 124, 214, 248, 428, 496, 856, 1712, 3317, 6634, 13268, 26536, 53072.
What is 53072 in binary?
1100111101010000 (hexadecimal CF50, octal 147520).
What is the square root of 53072?
About 230.3736, exactly 4√3317.
Is 53072 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 53072?
It is a composite number with 20 divisors.