The number 40912
40912 is a composite number with 10 divisors. Its prime factorisation is × 2557. Divisors (10): 1, 2, 4, 8, 16, 2557, 5114, 10228, 20456, 40912.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40912: a Harshad number: divisible by its digit sum 16.
- 2
40912 is composite. Its prime factorisation is
- 3
The divisors add up to 79298; without 40912 itself that is 38386, so 40912 is deficient (38386 is less than 40912). Euler's totient φ(40912) = 20448 numbers up to 40912 share no factor with it.
- 4
The digits of 40912 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40912 = 2^{4} \times 2557 \]40912 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 79298 |
| Euler totient φ(n) | 20448 |
| Square | 1673791744 |
| Cube | 68478167830528 |
| Square root | 202.267150 (= 4√2557) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.0912 × |
40912 in other forms
| Form | Value |
|---|---|
| In words | forty thousand nine hundred and twelve |
| Binary (base 2) | 1001111111010000 |
| Octal (base 8) | 117720 |
| Hexadecimal (base 16) | 9FD0 |
| Base 3 | 2002010021 |
| As time | 40912 seconds = 11 h 21 min 52 s |
Is 40912 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40912 ÷ 2 = 20456) | 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 | Yes (40912 ÷ 4 = 10228) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (40912 ÷ 8 = 5114) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40912 a prime number?
No. 40912 = × 2557, so it is divisible by 2.
What are the factors of 40912?
1, 2, 4, 8, 16, 2557, 5114, 10228, 20456, 40912.
What is 40912 in binary?
1001111111010000 (hexadecimal 9FD0, octal 117720).
What is the square root of 40912?
About 202.2672, exactly 4√2557.
Is 40912 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 40912?
40912 is a Harshad number: divisible by its digit sum 16.