The number 15358
15358 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 1097. Divisors (8): 1, 2, 7, 14, 1097, 2194, 7679, 15358.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15358 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15358 is composite. Its prime factorisation is
- 3
The divisors add up to 26352; without 15358 itself that is 10994, so 15358 is deficient (10994 is less than 15358). Euler's totient φ(15358) = 6576 numbers up to 15358 share no factor with it.
- 4
The digits of 15358 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15358 = 2 \times 7 \times 1097 \]
15358 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26352 |
| Euler totient φ(n) | 6576 |
| Square | 235868164 |
| Cube | 3622463262712 |
| Square root | 123.927398 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.5358 × |
15358 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and fifty-eight |
| Binary (base 2) | 11101111111110 |
| Octal (base 8) | 35776 |
| Hexadecimal (base 16) | 3BFE |
| Base 3 | 210001211 |
| As time | 15358 seconds = 4 h 15 min 58 s |
Is 15358 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15358 ÷ 2 = 7679) | 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 | Yes (15358 ÷ 7 = 2194) | 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 4) | 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 2) | 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 15358 a prime number?
No. 15358 = 2 × 7 × 1097, so it is divisible by 2.
What are the factors of 15358?
1, 2, 7, 14, 1097, 2194, 7679, 15358.
What is 15358 in binary?
11101111111110 (hexadecimal 3BFE, octal 35776).
What is the square root of 15358?
About 123.9274.
Is 15358 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 15358?
It is a composite number with 8 divisors.