The number 36938
36938 is a composite number with 16 divisors. Its prime factorisation is 2 × 11 × 23 × 73. Divisors (16): 1, 2, 11, 22, 23, 46, 73, 146, 253, 506, 803, 1606, 1679, 3358, 18469, 36938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36938 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36938 is composite. Its prime factorisation is
- 3
The divisors add up to 63936; without 36938 itself that is 26998, so 36938 is deficient (26998 is less than 36938). Euler's totient φ(36938) = 15840 numbers up to 36938 share no factor with it.
- 4
The digits of 36938 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 111 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36938 = 2 \times 11 \times 23 \times 73 \]
36938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 63936 |
| Euler totient φ(n) | 15840 |
| Square | 1364415844 |
| Cube | 50398792445672 |
| Square root | 192.192612 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 111 |
| Scientific notation | 3.6938 × |
36938 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and thirty-eight |
| Binary (base 2) | 1001000001001010 |
| Octal (base 8) | 110112 |
| Hexadecimal (base 16) | 904A |
| Base 3 | 1212200002 |
| As time | 36938 seconds = 10 h 15 min 38 s |
Is 36938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36938 ÷ 2 = 18469) | 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 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 | Yes (36938 ÷ 11 = 3358) | 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 36938 a prime number?
No. 36938 = 2 × 11 × 23 × 73, so it is divisible by 2.
What are the factors of 36938?
1, 2, 11, 22, 23, 46, 73, 146, 253, 506, 803, 1606, 1679, 3358, 18469, 36938.
What is 36938 in binary?
1001000001001010 (hexadecimal 904A, octal 110112).
What is the square root of 36938?
About 192.1926.
Is 36938 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 36938?
It is a composite number with 16 divisors.