The number 53092
53092 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1021. Divisors (12): 1, 2, 4, 13, 26, 52, 1021, 2042, 4084, 13273, 26546, 53092.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53092 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53092 is composite. Its prime factorisation is
- 3
The divisors add up to 100156; without 53092 itself that is 47064, so 53092 is deficient (47064 is less than 53092). Euler's totient φ(53092) = 24480 numbers up to 53092 share no factor with it.
- 4
The digits of 53092 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53092 = 2^{2} \times 13 \times 1021 \]53092 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 100156 |
| Euler totient φ(n) | 24480 |
| Square | 2818760464 |
| Cube | 149653630554688 |
| Square root | 230.417013 (= 2√13273) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3092 × |
53092 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and ninety-two |
| Binary (base 2) | 1100111101100100 |
| Octal (base 8) | 147544 |
| Hexadecimal (base 16) | CF64 |
| Base 3 | 2200211101 |
| As time | 53092 seconds = 14 h 44 min 52 s |
Is 53092 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53092 ÷ 2 = 26546) | 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 (53092 ÷ 4 = 13273) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 1) | 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 6) | 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 53092 a prime number?
No. 53092 = × 13 × 1021, so it is divisible by 2.
What are the factors of 53092?
1, 2, 4, 13, 26, 52, 1021, 2042, 4084, 13273, 26546, 53092.
What is 53092 in binary?
1100111101100100 (hexadecimal CF64, octal 147544).
What is the square root of 53092?
About 230.4170, exactly 2√13273.
Is 53092 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 53092?
It is a composite number with 12 divisors.