The number 15938
15938 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 613. Divisors (8): 1, 2, 13, 26, 613, 1226, 7969, 15938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15938: a Harshad number: divisible by its digit sum 26.
- 2
15938 is composite. Its prime factorisation is
- 3
The divisors add up to 25788; without 15938 itself that is 9850, so 15938 is deficient (9850 is less than 15938). Euler's totient φ(15938) = 7344 numbers up to 15938 share no factor with it.
- 4
The digits of 15938 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15938 = 2 \times 13 \times 613 \]
15938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25788 |
| Euler totient φ(n) | 7344 |
| Square | 254019844 |
| Cube | 4048568273672 |
| Square root | 126.245792 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5938 × |
15938 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and thirty-eight |
| Binary (base 2) | 11111001000010 |
| Octal (base 8) | 37102 |
| Hexadecimal (base 16) | 3E42 |
| Base 3 | 210212022 |
| As time | 15938 seconds = 4 h 25 min 38 s |
Is 15938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15938 ÷ 2 = 7969) | 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 | No (remainder 3) | 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 6) | 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 8) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15938 a prime number?
No. 15938 = 2 × 13 × 613, so it is divisible by 2.
What are the factors of 15938?
1, 2, 13, 26, 613, 1226, 7969, 15938.
What is 15938 in binary?
11111001000010 (hexadecimal 3E42, octal 37102).
What is the square root of 15938?
About 126.2458.
Is 15938 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 15938?
15938 is a Harshad number: divisible by its digit sum 26.