The number 938
938 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 67. Divisors (8): 1, 2, 7, 14, 67, 134, 469, 938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
938 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
938 is composite. Its prime factorisation is
- 3
The divisors add up to 1632; without 938 itself that is 694, so 938 is deficient (694 is less than 938). Euler's totient φ(938) = 396 numbers up to 938 share no factor with it.
- 4
The digits of 938 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 23 steps to reach 1.
LaTeX source of the formulas on this page
\[ 938 = 2 \times 7 \times 67 \]
938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1632 |
| Euler totient φ(n) | 396 |
| Square | 879844 |
| Cube | 825293672 |
| Square root | 30.626786 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 23 |
| Scientific notation | 9.38 × |
938 in other forms
| Form | Value |
|---|---|
| In words | nine hundred and thirty-eight |
| Roman numerals | CMXXXVIII |
| Binary (base 2) | 1110101010 |
| Octal (base 8) | 1652 |
| Hexadecimal (base 16) | 3AA |
| Base 3 | 1021202 |
| As time | 938 seconds = 15 min 38 s |
Is 938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (938 ÷ 2 = 469) | 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 | Yes (938 ÷ 7 = 134) | 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 2) | 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 3) | 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 938 a prime number?
No. 938 = 2 × 7 × 67, so it is divisible by 2.
What are the factors of 938?
1, 2, 7, 14, 67, 134, 469, 938.
What is 938 in binary?
1110101010 (hexadecimal 3AA, octal 1652).
What is the square root of 938?
About 30.6268.
What is 938 in Roman numerals?
CMXXXVIII.
Is 938 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 938?
It is a composite number with 8 divisors.