The number 15950
15950 is a composite number with 24 divisors. Its prime factorisation is 2 × × 11 × 29. Divisors (24): 1, 2, 5, 10, 11, 22, 25, 29, 50, 55, 58, 110, 145, 275, 290, 319 … 15950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15950 is composite. Its prime factorisation is
- 3
The divisors add up to 33480; without 15950 itself that is 17530, so 15950 is abundant (17530 is more than 15950). Euler's totient φ(15950) = 5600 numbers up to 15950 share no factor with it.
- 4
The digits of 15950 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15950 = 2 \times 5^{2} \times 11 \times 29 \]15950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 33480 |
| Euler totient φ(n) | 5600 |
| Square | 254402500 |
| Cube | 4057719875000 |
| Square root | 126.293309 (= 5√638) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.595 × |
15950 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and fifty |
| Binary (base 2) | 11111001001110 |
| Octal (base 8) | 37116 |
| Hexadecimal (base 16) | 3E4E |
| Base 3 | 210212202 |
| As time | 15950 seconds = 4 h 25 min 50 s |
Is 15950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15950 ÷ 2 = 7975) | 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 (15950 ÷ 5 = 3190) | 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 4) | 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 (15950 ÷ 10 = 1595) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15950 ÷ 11 = 1450) | 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 15950 a prime number?
No. 15950 = 2 × × 11 × 29, so it is divisible by 2.
What are the factors of 15950?
1, 2, 5, 10, 11, 22, 25, 29, 50, 55, 58, 110, 145, 275, 290, 319, 550, 638, 725, 1450, 1595, 3190, 7975, 15950.
What is 15950 in binary?
11111001001110 (hexadecimal 3E4E, octal 37116).
What is the square root of 15950?
About 126.2933, exactly 5√638.
Is 15950 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15950?
It is a composite number with 24 divisors.