The number 15090
15090 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 503. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 503, 1006, 1509, 2515, 3018, 5030, 7545, 15090.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15090: a Harshad number: divisible by its digit sum 15.
- 2
15090 is composite. Its prime factorisation is
- 3
The divisors add up to 36288; without 15090 itself that is 21198, so 15090 is abundant (21198 is more than 15090). Euler's totient φ(15090) = 4016 numbers up to 15090 share no factor with it.
- 4
The digits of 15090 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15090 = 2 \times 3 \times 5 \times 503 \]
15090 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 36288 |
| Euler totient φ(n) | 4016 |
| Square | 227708100 |
| Cube | 3436115229000 |
| Square root | 122.841361 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.509 × |
15090 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and ninety |
| Binary (base 2) | 11101011110010 |
| Octal (base 8) | 35362 |
| Hexadecimal (base 16) | 3AF2 |
| Base 3 | 202200220 |
| As time | 15090 seconds = 4 h 11 min 30 s |
Is 15090 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15090 ÷ 2 = 7545) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15090 ÷ 3 = 5030) | 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 (15090 ÷ 5 = 3018) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15090 ÷ 6 = 2515) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15090 ÷ 10 = 1509) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 15090 a prime number?
No. 15090 = 2 × 3 × 5 × 503, so it is divisible by 2.
What are the factors of 15090?
1, 2, 3, 5, 6, 10, 15, 30, 503, 1006, 1509, 2515, 3018, 5030, 7545, 15090.
What is 15090 in binary?
11101011110010 (hexadecimal 3AF2, octal 35362).
What is the square root of 15090?
About 122.8414.
Is 15090 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15090?
15090 is a Harshad number: divisible by its digit sum 15.