The number 5370
5370 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 179. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 179, 358, 537, 895, 1074, 1790, 2685, 5370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5370: a Harshad number: divisible by its digit sum 15.
- 2
5370 is composite. Its prime factorisation is
- 3
The divisors add up to 12960; without 5370 itself that is 7590, so 5370 is abundant (7590 is more than 5370). Euler's totient φ(5370) = 1424 numbers up to 5370 share no factor with it.
- 4
The digits of 5370 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5370 = 2 \times 3 \times 5 \times 179 \]
5370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 12960 |
| Euler totient φ(n) | 1424 |
| Square | 28836900 |
| Cube | 154854153000 |
| Square root | 73.280284 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 98 |
| Scientific notation | 5.37 × |
5370 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and seventy |
| Binary (base 2) | 1010011111010 |
| Octal (base 8) | 12372 |
| Hexadecimal (base 16) | 14FA |
| Base 3 | 21100220 |
| As time | 5370 seconds = 1 h 29 min 30 s |
Is 5370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5370 ÷ 2 = 2685) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5370 ÷ 3 = 1790) | 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 | Yes (5370 ÷ 5 = 1074) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (5370 ÷ 6 = 895) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5370 ÷ 10 = 537) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5370 a prime number?
No. 5370 = 2 × 3 × 5 × 179, so it is divisible by 2.
What are the factors of 5370?
1, 2, 3, 5, 6, 10, 15, 30, 179, 358, 537, 895, 1074, 1790, 2685, 5370.
What is 5370 in binary?
1010011111010 (hexadecimal 14FA, octal 12372).
What is the square root of 5370?
About 73.2803.
Is 5370 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5370?
5370 is a Harshad number: divisible by its digit sum 15.