The number 5938
5938 is a composite number with 4 divisors. Its prime factorisation is 2 × 2969. Divisors (4): 1, 2, 2969, 5938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5938: a semiprime: 2 × 2969, the product of two primes.
- 2
5938 is composite. Its prime factorisation is
- 3
The divisors add up to 8910; without 5938 itself that is 2972, so 5938 is deficient (2972 is less than 5938). Euler's totient φ(5938) = 2968 numbers up to 5938 share no factor with it.
- 4
The digits of 5938 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5938 = 2 \times 2969 \]
5938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 8910 |
| Euler totient φ(n) | 2968 |
| Square | 35259844 |
| Cube | 209372953672 |
| Square root | 77.058419 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 142 |
| Scientific notation | 5.938 × |
5938 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and thirty-eight |
| Binary (base 2) | 1011100110010 |
| Octal (base 8) | 13462 |
| Hexadecimal (base 16) | 1732 |
| Base 3 | 22010221 |
| As time | 5938 seconds = 1 h 38 min 58 s |
Is 5938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5938 ÷ 2 = 2969) | 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 2) | 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 7) | 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 9) | 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 5938 a prime number?
No. 5938 = 2 × 2969, so it is divisible by 2.
What are the factors of 5938?
1, 2, 2969, 5938.
What is 5938 in binary?
1011100110010 (hexadecimal 1732, octal 13462).
What is the square root of 5938?
About 77.0584.
Is 5938 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 5938?
5938 is a semiprime: 2 × 2969, the product of two primes.