The number 40522
40522 is a composite number with 4 divisors. Its prime factorisation is 2 × 20261. Divisors (4): 1, 2, 20261, 40522.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40522: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 20261, the product of two primes.
- 2
40522 is composite. Its prime factorisation is
- 3
The divisors add up to 60786; without 40522 itself that is 20264, so 40522 is deficient (20264 is less than 40522). Euler's totient φ(40522) = 20260 numbers up to 40522 share no factor with it.
- 4
The digits of 40522 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40522 = 2 \times 20261 \]
40522 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60786 |
| Euler totient φ(n) | 20260 |
| Square | 1642032484 |
| Cube | 66538440316648 |
| Square root | 201.300770 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.0522 × |
40522 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and twenty-two |
| Binary (base 2) | 1001111001001010 |
| Octal (base 8) | 117112 |
| Hexadecimal (base 16) | 9E4A |
| Base 3 | 2001120211 |
| As time | 40522 seconds = 11 h 15 min 22 s |
Is 40522 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40522 ÷ 2 = 20261) | 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 | 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 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 4) | 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 9) | 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 40522 a prime number?
No. 40522 = 2 × 20261, so it is divisible by 2.
What are the factors of 40522?
1, 2, 20261, 40522.
What is 40522 in binary?
1001111001001010 (hexadecimal 9E4A, octal 117112).
What is the square root of 40522?
About 201.3008.
Is 40522 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 40522?
40522 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 20261, the product of two primes.