The number 15958
15958 is a composite number with 8 divisors. Its prime factorisation is 2 × 79 × 101. Divisors (8): 1, 2, 79, 101, 158, 202, 7979, 15958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15958 is composite. Its prime factorisation is
- 3
The divisors add up to 24480; without 15958 itself that is 8522, so 15958 is deficient (8522 is less than 15958). Euler's totient φ(15958) = 7800 numbers up to 15958 share no factor with it.
- 4
The digits of 15958 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15958 = 2 \times 79 \times 101 \]
15958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24480 |
| Euler totient φ(n) | 7800 |
| Square | 254657764 |
| Cube | 4063828597912 |
| Square root | 126.324978 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5958 × |
15958 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and fifty-eight |
| Binary (base 2) | 11111001010110 |
| Octal (base 8) | 37126 |
| Hexadecimal (base 16) | 3E56 |
| Base 3 | 210220001 |
| As time | 15958 seconds = 4 h 25 min 58 s |
Is 15958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15958 ÷ 2 = 7979) | 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 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 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 8) | 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 15958 a prime number?
No. 15958 = 2 × 79 × 101, so it is divisible by 2.
What are the factors of 15958?
1, 2, 79, 101, 158, 202, 7979, 15958.
What is 15958 in binary?
11111001010110 (hexadecimal 3E56, octal 37126).
What is the square root of 15958?
About 126.3250.
Is 15958 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 15958?
It is a composite number with 8 divisors.