The number 40502
40502 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 11 × 263. Divisors (16): 1, 2, 7, 11, 14, 22, 77, 154, 263, 526, 1841, 2893, 3682, 5786, 20251, 40502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40502: a Harshad number: divisible by its digit sum 11.
- 2
40502 is composite. Its prime factorisation is
- 3
The divisors add up to 76032; without 40502 itself that is 35530, so 40502 is deficient (35530 is less than 40502). Euler's totient φ(40502) = 15720 numbers up to 40502 share no factor with it.
- 4
The digits of 40502 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 212 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40502 = 2 \times 7 \times 11 \times 263 \]
40502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 76032 |
| Euler totient φ(n) | 15720 |
| Square | 1640412004 |
| Cube | 66439966986008 |
| Square root | 201.251087 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 212 |
| Scientific notation | 4.0502 × |
40502 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and two |
| Binary (base 2) | 1001111000110110 |
| Octal (base 8) | 117066 |
| Hexadecimal (base 16) | 9E36 |
| Base 3 | 2001120002 |
| As time | 40502 seconds = 11 h 15 min 2 s |
Is 40502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40502 ÷ 2 = 20251) | 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 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (40502 ÷ 7 = 5786) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (40502 ÷ 11 = 3682) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40502 a prime number?
No. 40502 = 2 × 7 × 11 × 263, so it is divisible by 2.
What are the factors of 40502?
1, 2, 7, 11, 14, 22, 77, 154, 263, 526, 1841, 2893, 3682, 5786, 20251, 40502.
What is 40502 in binary?
1001111000110110 (hexadecimal 9E36, octal 117066).
What is the square root of 40502?
About 201.2511.
Is 40502 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 40502?
40502 is a Harshad number: divisible by its digit sum 11.