The number 15460
15460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 773. Divisors (12): 1, 2, 4, 5, 10, 20, 773, 1546, 3092, 3865, 7730, 15460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15460 is composite. Its prime factorisation is
- 3
The divisors add up to 32508; without 15460 itself that is 17048, so 15460 is abundant (17048 is more than 15460). Euler's totient φ(15460) = 6176 numbers up to 15460 share no factor with it.
- 4
The digits of 15460 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
\[ 15460 = 2^{2} \times 5 \times 773 \]15460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 32508 |
| Euler totient φ(n) | 6176 |
| Square | 239011600 |
| Cube | 3695119336000 |
| Square root | 124.338248 (= 2√3865) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.546 × |
15460 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and sixty |
| Binary (base 2) | 11110001100100 |
| Octal (base 8) | 36144 |
| Hexadecimal (base 16) | 3C64 |
| Base 3 | 210012121 |
| As time | 15460 seconds = 4 h 17 min 40 s |
Is 15460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15460 ÷ 2 = 7730) | 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 (15460 ÷ 4 = 3865) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15460 ÷ 5 = 3092) | 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 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 4) | 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 (15460 ÷ 10 = 1546) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 15460 a prime number?
No. 15460 = × 5 × 773, so it is divisible by 2.
What are the factors of 15460?
1, 2, 4, 5, 10, 20, 773, 1546, 3092, 3865, 7730, 15460.
What is 15460 in binary?
11110001100100 (hexadecimal 3C64, octal 36144).
What is the square root of 15460?
About 124.3382, exactly 2√3865.
Is 15460 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 15460?
It is a composite number with 12 divisors.