The number 53579
53579 is a composite number with 4 divisors. Its prime factorisation is 131 × 409. Divisors (4): 1, 131, 409, 53579.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53579: a semiprime: 131 × 409, the product of two primes.
- 2
53579 is composite. Its prime factorisation is
- 3
The divisors add up to 54120; without 53579 itself that is 541, so 53579 is deficient (541 is less than 53579). Euler's totient φ(53579) = 53040 numbers up to 53579 share no factor with it.
- 4
The digits of 53579 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53579 = 131 \times 409 \]
53579 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54120 |
| Euler totient φ(n) | 53040 |
| Square | 2870709241 |
| Cube | 153809730423539 |
| Square root | 231.471381 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3579 × |
53579 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand five hundred and seventy-nine |
| Binary (base 2) | 1101000101001011 |
| Octal (base 8) | 150513 |
| Hexadecimal (base 16) | D14B |
| Base 3 | 2201111102 |
| As time | 53579 seconds = 14 h 52 min 59 s |
Is 53579 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53579 a prime number?
No. 53579 = 131 × 409, so it is divisible by 131.
What are the factors of 53579?
1, 131, 409, 53579.
What is 53579 in binary?
1101000101001011 (hexadecimal D14B, octal 150513).
What is the square root of 53579?
About 231.4714.
Is 53579 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 53579?
53579 is a semiprime: 131 × 409, the product of two primes.