The number 40781
40781 is a composite number with 4 divisors. Its prime factorisation is 13 × 3137. Divisors (4): 1, 13, 3137, 40781.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40781: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3137, the product of two primes.
- 2
40781 is composite. Its prime factorisation is
- 3
The divisors add up to 43932; without 40781 itself that is 3151, so 40781 is deficient (3151 is less than 40781). Euler's totient φ(40781) = 37632 numbers up to 40781 share no factor with it.
- 4
The digits of 40781 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 181 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40781 = 13 \times 3137 \]
40781 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 43932 |
| Euler totient φ(n) | 37632 |
| Square | 1663089961 |
| Cube | 67822471699541 |
| Square root | 201.943061 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 181 |
| Scientific notation | 4.0781 × |
40781 in other forms
| Form | Value |
|---|---|
| In words | forty thousand seven hundred and eighty-one |
| Binary (base 2) | 1001111101001101 |
| Octal (base 8) | 117515 |
| Hexadecimal (base 16) | 9F4D |
| Base 3 | 2001221102 |
| As time | 40781 seconds = 11 h 19 min 41 s |
Is 40781 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 1) | 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 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40781 a prime number?
No. 40781 = 13 × 3137, so it is divisible by 13.
What are the factors of 40781?
1, 13, 3137, 40781.
What is 40781 in binary?
1001111101001101 (hexadecimal 9F4D, octal 117515).
What is the square root of 40781?
About 201.9431.
Is 40781 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 40781?
40781 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3137, the product of two primes.