The number 15130
15130 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 17 × 89. Divisors (16): 1, 2, 5, 10, 17, 34, 85, 89, 170, 178, 445, 890, 1513, 3026, 7565, 15130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15130: a Harshad number: divisible by its digit sum 10.
- 2
15130 is composite. Its prime factorisation is
- 3
The divisors add up to 29160; without 15130 itself that is 14030, so 15130 is deficient (14030 is less than 15130). Euler's totient φ(15130) = 5632 numbers up to 15130 share no factor with it.
- 4
The digits of 15130 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15130 = 2 \times 5 \times 17 \times 89 \]
15130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 29160 |
| Euler totient φ(n) | 5632 |
| Square | 228916900 |
| Cube | 3463512697000 |
| Square root | 123.004065 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.513 × |
15130 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and thirty |
| Binary (base 2) | 11101100011010 |
| Octal (base 8) | 35432 |
| Hexadecimal (base 16) | 3B1A |
| Base 3 | 202202101 |
| As time | 15130 seconds = 4 h 12 min 10 s |
Is 15130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15130 ÷ 2 = 7565) | 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 (15130 ÷ 5 = 3026) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15130 ÷ 10 = 1513) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15130 a prime number?
No. 15130 = 2 × 5 × 17 × 89, so it is divisible by 2.
What are the factors of 15130?
1, 2, 5, 10, 17, 34, 85, 89, 170, 178, 445, 890, 1513, 3026, 7565, 15130.
What is 15130 in binary?
11101100011010 (hexadecimal 3B1A, octal 35432).
What is the square root of 15130?
About 123.0041.
Is 15130 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 15130?
15130 is a Harshad number: divisible by its digit sum 10.