The number 15340
15340 is a composite number with 24 divisors. Its prime factorisation is × 5 × 13 × 59. Divisors (24): 1, 2, 4, 5, 10, 13, 20, 26, 52, 59, 65, 118, 130, 236, 260, 295 … 15340.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15340: a Harshad number: divisible by its digit sum 13.
- 2
15340 is composite. Its prime factorisation is
- 3
The divisors add up to 35280; without 15340 itself that is 19940, so 15340 is abundant (19940 is more than 15340). Euler's totient φ(15340) = 5568 numbers up to 15340 share no factor with it.
- 4
The digits of 15340 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15340 = 2^{2} \times 5 \times 13 \times 59 \]15340 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 35280 |
| Euler totient φ(n) | 5568 |
| Square | 235315600 |
| Cube | 3609741304000 |
| Square root | 123.854754 (= 2√3835) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.534 × |
15340 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and forty |
| Binary (base 2) | 11101111101100 |
| Octal (base 8) | 35754 |
| Hexadecimal (base 16) | 3BEC |
| Base 3 | 210001011 |
| As time | 15340 seconds = 4 h 15 min 40 s |
Is 15340 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15340 ÷ 2 = 7670) | 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 | Yes (15340 ÷ 4 = 3835) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15340 ÷ 5 = 3068) | 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 3) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15340 ÷ 10 = 1534) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15340 a prime number?
No. 15340 = × 5 × 13 × 59, so it is divisible by 2.
What are the factors of 15340?
1, 2, 4, 5, 10, 13, 20, 26, 52, 59, 65, 118, 130, 236, 260, 295, 590, 767, 1180, 1534, 3068, 3835, 7670, 15340.
What is 15340 in binary?
11101111101100 (hexadecimal 3BEC, octal 35754).
What is the square root of 15340?
About 123.8548, exactly 2√3835.
Is 15340 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15340?
15340 is a Harshad number: divisible by its digit sum 13.