The number 40690
40690 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 313. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 130, 313, 626, 1565, 3130, 4069, 8138, 20345, 40690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40690: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
40690 is composite. Its prime factorisation is
- 3
The divisors add up to 79128; without 40690 itself that is 38438, so 40690 is deficient (38438 is less than 40690). Euler's totient φ(40690) = 14976 numbers up to 40690 share no factor with it.
- 4
The digits of 40690 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 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40690 = 2 \times 5 \times 13 \times 313 \]
40690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 79128 |
| Euler totient φ(n) | 14976 |
| Square | 1655676100 |
| Cube | 67369460509000 |
| Square root | 201.717624 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.069 × |
40690 in other forms
| Form | Value |
|---|---|
| In words | forty thousand six hundred and ninety |
| Binary (base 2) | 1001111011110010 |
| Octal (base 8) | 117362 |
| Hexadecimal (base 16) | 9EF2 |
| Base 3 | 2001211001 |
| As time | 40690 seconds = 11 h 18 min 10 s |
Is 40690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40690 ÷ 2 = 20345) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (40690 ÷ 5 = 8138) | 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 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 2) | 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 | Yes (40690 ÷ 10 = 4069) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40690 a prime number?
No. 40690 = 2 × 5 × 13 × 313, so it is divisible by 2.
What are the factors of 40690?
1, 2, 5, 10, 13, 26, 65, 130, 313, 626, 1565, 3130, 4069, 8138, 20345, 40690.
What is 40690 in binary?
1001111011110010 (hexadecimal 9EF2, octal 117362).
What is the square root of 40690?
About 201.7176.
Is 40690 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 40690?
40690 is a happy number: repeatedly adding the squares of its digits reaches 1.