The number 15230
15230 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1523. Divisors (8): 1, 2, 5, 10, 1523, 3046, 7615, 15230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15230 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15230 is composite. Its prime factorisation is
- 3
The divisors add up to 27432; without 15230 itself that is 12202, so 15230 is deficient (12202 is less than 15230). Euler's totient φ(15230) = 6088 numbers up to 15230 share no factor with it.
- 4
The digits of 15230 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15230 = 2 \times 5 \times 1523 \]
15230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 27432 |
| Euler totient φ(n) | 6088 |
| Square | 231952900 |
| Cube | 3532642667000 |
| Square root | 123.409886 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.523 × |
15230 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and thirty |
| Binary (base 2) | 11101101111110 |
| Octal (base 8) | 35576 |
| Hexadecimal (base 16) | 3B7E |
| Base 3 | 202220002 |
| As time | 15230 seconds = 4 h 13 min 50 s |
Is 15230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15230 ÷ 2 = 7615) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (15230 ÷ 5 = 3046) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15230 ÷ 10 = 1523) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15230 a prime number?
No. 15230 = 2 × 5 × 1523, so it is divisible by 2.
What are the factors of 15230?
1, 2, 5, 10, 1523, 3046, 7615, 15230.
What is 15230 in binary?
11101101111110 (hexadecimal 3B7E, octal 35576).
What is the square root of 15230?
About 123.4099.
Is 15230 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 15230?
It is a composite number with 8 divisors.