The number 40461
40461 is a composite number with 4 divisors. Its prime factorisation is 3 × 13487. Divisors (4): 1, 3, 13487, 40461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40461: a semiprime: 3 × 13487, the product of two primes.
- 2
40461 is composite. Its prime factorisation is
- 3
The divisors add up to 53952; without 40461 itself that is 13491, so 40461 is deficient (13491 is less than 40461). Euler's totient φ(40461) = 26972 numbers up to 40461 share no factor with it.
- 4
The digits of 40461 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 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40461 = 3 \times 13487 \]
40461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53952 |
| Euler totient φ(n) | 26972 |
| Square | 1637092521 |
| Cube | 66238400492181 |
| Square root | 201.149198 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.0461 × |
40461 in other forms
| Form | Value |
|---|---|
| In words | forty thousand four hundred and sixty-one |
| Binary (base 2) | 1001111000001101 |
| Octal (base 8) | 117015 |
| Hexadecimal (base 16) | 9E0D |
| Base 3 | 2001111120 |
| As time | 40461 seconds = 11 h 14 min 21 s |
Is 40461 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (40461 ÷ 3 = 13487) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 | No (remainder 3) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40461 a prime number?
No. 40461 = 3 × 13487, so it is divisible by 3.
What are the factors of 40461?
1, 3, 13487, 40461.
What is 40461 in binary?
1001111000001101 (hexadecimal 9E0D, octal 117015).
What is the square root of 40461?
About 201.1492.
Is 40461 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 40461?
40461 is a semiprime: 3 × 13487, the product of two primes.