The number 40506
40506 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 43 × 157. Divisors (16): 1, 2, 3, 6, 43, 86, 129, 157, 258, 314, 471, 942, 6751, 13502, 20253, 40506.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
40506 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
40506 is composite. Its prime factorisation is
- 3
The divisors add up to 83424; without 40506 itself that is 42918, so 40506 is abundant (42918 is more than 40506). Euler's totient φ(40506) = 13104 numbers up to 40506 share no factor with it.
- 4
The digits of 40506 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40506 = 2 \times 3 \times 43 \times 157 \]
40506 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 83424 |
| Euler totient φ(n) | 13104 |
| Square | 1640736036 |
| Cube | 66459653874216 |
| Square root | 201.261025 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.0506 × |
40506 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and six |
| Binary (base 2) | 1001111000111010 |
| Octal (base 8) | 117072 |
| Hexadecimal (base 16) | 9E3A |
| Base 3 | 2001120020 |
| As time | 40506 seconds = 11 h 15 min 6 s |
Is 40506 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40506 ÷ 2 = 20253) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (40506 ÷ 3 = 13502) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (40506 ÷ 6 = 6751) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 40506 a prime number?
No. 40506 = 2 × 3 × 43 × 157, so it is divisible by 2.
What are the factors of 40506?
1, 2, 3, 6, 43, 86, 129, 157, 258, 314, 471, 942, 6751, 13502, 20253, 40506.
What is 40506 in binary?
1001111000111010 (hexadecimal 9E3A, octal 117072).
What is the square root of 40506?
About 201.2610.
Is 40506 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 40506?
It is a composite number with 16 divisors.