The number 15489
15489 is a composite number with 6 divisors. Its prime factorisation is × 1721. Divisors (6): 1, 3, 9, 1721, 5163, 15489.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15489 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15489 is composite. Its prime factorisation is
- 3
The divisors add up to 22386; without 15489 itself that is 6897, so 15489 is deficient (6897 is less than 15489). Euler's totient φ(15489) = 10320 numbers up to 15489 share no factor with it.
- 4
The digits of 15489 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15489 = 3^{2} \times 1721 \]15489 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 22386 |
| Euler totient φ(n) | 10320 |
| Square | 239909121 |
| Cube | 3715952375169 |
| Square root | 124.454811 (= 3√1721) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5489 × |
15489 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and eighty-nine |
| Binary (base 2) | 11110010000001 |
| Octal (base 8) | 36201 |
| Hexadecimal (base 16) | 3C81 |
| Base 3 | 210020200 |
| As time | 15489 seconds = 4 h 18 min 9 s |
Is 15489 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 (15489 ÷ 3 = 5163) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15489 ÷ 9 = 1721) | 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 1) | 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 15489 a prime number?
No. 15489 = × 1721, so it is divisible by 3.
What are the factors of 15489?
1, 3, 9, 1721, 5163, 15489.
What is 15489 in binary?
11110010000001 (hexadecimal 3C81, octal 36201).
What is the square root of 15489?
About 124.4548, exactly 3√1721.
Is 15489 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 15489?
It is a composite number with 6 divisors.