The number 57369
57369 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1471. Divisors (8): 1, 3, 13, 39, 1471, 4413, 19123, 57369.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57369 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57369 is composite. Its prime factorisation is
- 3
The divisors add up to 82432; without 57369 itself that is 25063, so 57369 is deficient (25063 is less than 57369). Euler's totient φ(57369) = 35280 numbers up to 57369 share no factor with it.
- 4
The digits of 57369 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57369 = 3 \times 13 \times 1471 \]
57369 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 82432 |
| Euler totient φ(n) | 35280 |
| Square | 3291202161 |
| Cube | 188812976774409 |
| Square root | 239.518267 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.7369 × |
57369 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand three hundred and sixty-nine |
| Binary (base 2) | 1110000000011001 |
| Octal (base 8) | 160031 |
| Hexadecimal (base 16) | E019 |
| Base 3 | 2220200210 |
| As time | 57369 seconds = 15 h 56 min 9 s |
Is 57369 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 (57369 ÷ 3 = 19123) | 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 4) | 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 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 1) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 57369 a prime number?
No. 57369 = 3 × 13 × 1471, so it is divisible by 3.
What are the factors of 57369?
1, 3, 13, 39, 1471, 4413, 19123, 57369.
What is 57369 in binary?
1110000000011001 (hexadecimal E019, octal 160031).
What is the square root of 57369?
About 239.5183.
Is 57369 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 57369?
It is a composite number with 8 divisors.