The number 53146
53146 is a composite number with 4 divisors. Its prime factorisation is 2 × 26573. Divisors (4): 1, 2, 26573, 53146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53146: a semiprime: 2 × 26573, the product of two primes.
- 2
53146 is composite. Its prime factorisation is
- 3
The divisors add up to 79722; without 53146 itself that is 26576, so 53146 is deficient (26576 is less than 53146). Euler's totient φ(53146) = 26572 numbers up to 53146 share no factor with it.
- 4
The digits of 53146 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53146 = 2 \times 26573 \]
53146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 79722 |
| Euler totient φ(n) | 26572 |
| Square | 2824497316 |
| Cube | 150110734356136 |
| Square root | 230.534162 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.3146 × |
53146 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand one hundred and forty-six |
| Binary (base 2) | 1100111110011010 |
| Octal (base 8) | 147632 |
| Hexadecimal (base 16) | CF9A |
| Base 3 | 2200220101 |
| As time | 53146 seconds = 14 h 45 min 46 s |
Is 53146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53146 ÷ 2 = 26573) | 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 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53146 a prime number?
No. 53146 = 2 × 26573, so it is divisible by 2.
What are the factors of 53146?
1, 2, 26573, 53146.
What is 53146 in binary?
1100111110011010 (hexadecimal CF9A, octal 147632).
What is the square root of 53146?
About 230.5342.
Is 53146 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 53146?
53146 is a semiprime: 2 × 26573, the product of two primes.