The number 40695
40695 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 2713. Divisors (8): 1, 3, 5, 15, 2713, 8139, 13565, 40695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
40695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
40695 is composite. Its prime factorisation is
- 3
The divisors add up to 65136; without 40695 itself that is 24441, so 40695 is deficient (24441 is less than 40695). Euler's totient φ(40695) = 21696 numbers up to 40695 share no factor with it.
- 4
The digits of 40695 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40695 = 3 \times 5 \times 2713 \]
40695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65136 |
| Euler totient φ(n) | 21696 |
| Square | 1656083025 |
| Cube | 67394298702375 |
| Square root | 201.730018 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.0695 × |
40695 in other forms
| Form | Value |
|---|---|
| In words | forty thousand six hundred and ninety-five |
| Binary (base 2) | 1001111011110111 |
| Octal (base 8) | 117367 |
| Hexadecimal (base 16) | 9EF7 |
| Base 3 | 2001211020 |
| As time | 40695 seconds = 11 h 18 min 15 s |
Is 40695 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 | Yes (40695 ÷ 3 = 13565) | 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 | Yes (40695 ÷ 5 = 8139) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40695 a prime number?
No. 40695 = 3 × 5 × 2713, so it is divisible by 3.
What are the factors of 40695?
1, 3, 5, 15, 2713, 8139, 13565, 40695.
What is 40695 in binary?
1001111011110111 (hexadecimal 9EF7, octal 117367).
What is the square root of 40695?
About 201.7300.
Is 40695 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 40695?
It is a composite number with 8 divisors.