The number 40482
40482 is a composite number with 24 divisors. Its prime factorisation is 2 × × 13 × 173. Divisors (24): 1, 2, 3, 6, 9, 13, 18, 26, 39, 78, 117, 173, 234, 346, 519, 1038 … 40482.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40482: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
40482 is composite. Its prime factorisation is
- 3
The divisors add up to 95004; without 40482 itself that is 54522, so 40482 is abundant (54522 is more than 40482). Euler's totient φ(40482) = 12384 numbers up to 40482 share no factor with it.
- 4
The digits of 40482 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40482 = 2 \times 3^{2} \times 13 \times 173 \]40482 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 95004 |
| Euler totient φ(n) | 12384 |
| Square | 1638792324 |
| Cube | 66341590860168 |
| Square root | 201.201392 (= 3√4498) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.0482 × |
40482 in other forms
| Form | Value |
|---|---|
| In words | forty thousand four hundred and eighty-two |
| Binary (base 2) | 1001111000100010 |
| Octal (base 8) | 117042 |
| Hexadecimal (base 16) | 9E22 |
| Base 3 | 2001112100 |
| As time | 40482 seconds = 11 h 14 min 42 s |
Is 40482 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40482 ÷ 2 = 20241) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (40482 ÷ 3 = 13494) | 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 | Yes (40482 ÷ 6 = 6747) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (40482 ÷ 9 = 4498) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40482 a prime number?
No. 40482 = 2 × × 13 × 173, so it is divisible by 2.
What are the factors of 40482?
1, 2, 3, 6, 9, 13, 18, 26, 39, 78, 117, 173, 234, 346, 519, 1038, 1557, 2249, 3114, 4498, 6747, 13494, 20241, 40482.
What is 40482 in binary?
1001111000100010 (hexadecimal 9E22, octal 117042).
What is the square root of 40482?
About 201.2014, exactly 3√4498.
Is 40482 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 40482?
40482 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.