The number 15370
15370 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 29 × 53. Divisors (16): 1, 2, 5, 10, 29, 53, 58, 106, 145, 265, 290, 530, 1537, 3074, 7685, 15370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15370 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15370 is composite. Its prime factorisation is
- 3
The divisors add up to 29160; without 15370 itself that is 13790, so 15370 is deficient (13790 is less than 15370). Euler's totient φ(15370) = 5824 numbers up to 15370 share no factor with it.
- 4
The digits of 15370 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15370 = 2 \times 5 \times 29 \times 53 \]
15370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 29160 |
| Euler totient φ(n) | 5824 |
| Square | 236236900 |
| Cube | 3630961153000 |
| Square root | 123.975804 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.537 × |
15370 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and seventy |
| Binary (base 2) | 11110000001010 |
| Octal (base 8) | 36012 |
| Hexadecimal (base 16) | 3C0A |
| Base 3 | 210002021 |
| As time | 15370 seconds = 4 h 16 min 10 s |
Is 15370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15370 ÷ 2 = 7685) | 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 | Yes (15370 ÷ 5 = 3074) | 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 5) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15370 ÷ 10 = 1537) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 15370 a prime number?
No. 15370 = 2 × 5 × 29 × 53, so it is divisible by 2.
What are the factors of 15370?
1, 2, 5, 10, 29, 53, 58, 106, 145, 265, 290, 530, 1537, 3074, 7685, 15370.
What is 15370 in binary?
11110000001010 (hexadecimal 3C0A, octal 36012).
What is the square root of 15370?
About 123.9758.
Is 15370 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 15370?
It is a composite number with 16 divisors.