The number 15058
15058 is a composite number with 4 divisors. Its prime factorisation is 2 × 7529. Divisors (4): 1, 2, 7529, 15058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15058: a semiprime: 2 × 7529, the product of two primes.
- 2
15058 is composite. Its prime factorisation is
- 3
The divisors add up to 22590; without 15058 itself that is 7532, so 15058 is deficient (7532 is less than 15058). Euler's totient φ(15058) = 7528 numbers up to 15058 share no factor with it.
- 4
The digits of 15058 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15058 = 2 \times 7529 \]
15058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22590 |
| Euler totient φ(n) | 7528 |
| Square | 226743364 |
| Cube | 3414301575112 |
| Square root | 122.711043 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.5058 × |
15058 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and fifty-eight |
| Binary (base 2) | 11101011010010 |
| Octal (base 8) | 35322 |
| Hexadecimal (base 16) | 3AD2 |
| Base 3 | 202122201 |
| As time | 15058 seconds = 4 h 10 min 58 s |
Is 15058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15058 ÷ 2 = 7529) | 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 | No (remainder 3) | 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 1) | 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 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 15058 a prime number?
No. 15058 = 2 × 7529, so it is divisible by 2.
What are the factors of 15058?
1, 2, 7529, 15058.
What is 15058 in binary?
11101011010010 (hexadecimal 3AD2, octal 35322).
What is the square root of 15058?
About 122.7110.
Is 15058 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15058?
15058 is a semiprime: 2 × 7529, the product of two primes.