The number 38951
38951 is a composite number with 4 divisors. Its prime factorisation is 11 × 3541. Divisors (4): 1, 11, 3541, 38951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 38951: a semiprime: 11 × 3541, the product of two primes.
- 2
38951 is composite. Its prime factorisation is
- 3
The divisors add up to 42504; without 38951 itself that is 3553, so 38951 is deficient (3553 is less than 38951). Euler's totient φ(38951) = 35400 numbers up to 38951 share no factor with it.
- 4
The digits of 38951 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 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 38951 = 11 \times 3541 \]
38951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42504 |
| Euler totient φ(n) | 35400 |
| Square | 1517180401 |
| Cube | 59095693799351 |
| Square root | 197.360077 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 106 |
| Scientific notation | 3.8951 × |
38951 in other forms
| Form | Value |
|---|---|
| In words | thirty-eight thousand nine hundred and fifty-one |
| Binary (base 2) | 1001100000100111 |
| Octal (base 8) | 114047 |
| Hexadecimal (base 16) | 9827 |
| Base 3 | 1222102122 |
| As time | 38951 seconds = 10 h 49 min 11 s |
Is 38951 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (38951 ÷ 11 = 3541) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 38951 a prime number?
No. 38951 = 11 × 3541, so it is divisible by 11.
What are the factors of 38951?
1, 11, 3541, 38951.
What is 38951 in binary?
1001100000100111 (hexadecimal 9827, octal 114047).
What is the square root of 38951?
About 197.3601.
Is 38951 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 38951?
38951 is a semiprime: 11 × 3541, the product of two primes.