The number 40951
40951 is a composite number with 4 divisors. Its prime factorisation is 31 × 1321. Divisors (4): 1, 31, 1321, 40951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40951: a semiprime: 31 × 1321, the product of two primes.
- 2
40951 is composite. Its prime factorisation is
- 3
The divisors add up to 42304; without 40951 itself that is 1353, so 40951 is deficient (1353 is less than 40951). Euler's totient φ(40951) = 39600 numbers up to 40951 share no factor with it.
- 4
The digits of 40951 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 62 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40951 = 31 \times 1321 \]
40951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42304 |
| Euler totient φ(n) | 39600 |
| Square | 1676984401 |
| Cube | 68674188205351 |
| Square root | 202.363534 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 62 |
| Scientific notation | 4.0951 × |
40951 in other forms
| Form | Value |
|---|---|
| In words | forty thousand nine hundred and fifty-one |
| Binary (base 2) | 1001111111110111 |
| Octal (base 8) | 117767 |
| Hexadecimal (base 16) | 9FF7 |
| Base 3 | 2002011201 |
| As time | 40951 seconds = 11 h 22 min 31 s |
Is 40951 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | 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 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40951 a prime number?
No. 40951 = 31 × 1321, so it is divisible by 31.
What are the factors of 40951?
1, 31, 1321, 40951.
What is 40951 in binary?
1001111111110111 (hexadecimal 9FF7, octal 117767).
What is the square root of 40951?
About 202.3635.
Is 40951 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 40951?
40951 is a semiprime: 31 × 1321, the product of two primes.