The number 15790
15790 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1579. Divisors (8): 1, 2, 5, 10, 1579, 3158, 7895, 15790.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15790 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15790 is composite. Its prime factorisation is
- 3
The divisors add up to 28440; without 15790 itself that is 12650, so 15790 is deficient (12650 is less than 15790). Euler's totient φ(15790) = 6312 numbers up to 15790 share no factor with it.
- 4
The digits of 15790 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 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15790 = 2 \times 5 \times 1579 \]
15790 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 28440 |
| Euler totient φ(n) | 6312 |
| Square | 249324100 |
| Cube | 3936827539000 |
| Square root | 125.658267 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 190 |
| Scientific notation | 1.579 × |
15790 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand seven hundred and ninety |
| Binary (base 2) | 11110110101110 |
| Octal (base 8) | 36656 |
| Hexadecimal (base 16) | 3DAE |
| Base 3 | 210122211 |
| As time | 15790 seconds = 4 h 23 min 10 s |
Is 15790 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15790 ÷ 2 = 7895) | 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 | Yes (15790 ÷ 5 = 3158) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15790 ÷ 10 = 1579) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 15790 a prime number?
No. 15790 = 2 × 5 × 1579, so it is divisible by 2.
What are the factors of 15790?
1, 2, 5, 10, 1579, 3158, 7895, 15790.
What is 15790 in binary?
11110110101110 (hexadecimal 3DAE, octal 36656).
What is the square root of 15790?
About 125.6583.
Is 15790 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 15790?
It is a composite number with 8 divisors.