The number 15258
15258 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 2543. Divisors (8): 1, 2, 3, 6, 2543, 5086, 7629, 15258.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15258 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15258 is composite. Its prime factorisation is
- 3
The divisors add up to 30528; without 15258 itself that is 15270, so 15258 is abundant (15270 is more than 15258). Euler's totient φ(15258) = 5084 numbers up to 15258 share no factor with it.
- 4
The digits of 15258 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15258 = 2 \times 3 \times 2543 \]
15258 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30528 |
| Euler totient φ(n) | 5084 |
| Square | 232806564 |
| Cube | 3552162553512 |
| Square root | 123.523277 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 32 |
| Scientific notation | 1.5258 × |
15258 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and fifty-eight |
| Binary (base 2) | 11101110011010 |
| Octal (base 8) | 35632 |
| Hexadecimal (base 16) | 3B9A |
| Base 3 | 202221010 |
| As time | 15258 seconds = 4 h 14 min 18 s |
Is 15258 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15258 ÷ 2 = 7629) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15258 ÷ 3 = 5086) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15258 ÷ 6 = 2543) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15258 a prime number?
No. 15258 = 2 × 3 × 2543, so it is divisible by 2.
What are the factors of 15258?
1, 2, 3, 6, 2543, 5086, 7629, 15258.
What is 15258 in binary?
11101110011010 (hexadecimal 3B9A, octal 35632).
What is the square root of 15258?
About 123.5233.
Is 15258 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15258?
It is a composite number with 8 divisors.