The number 40481
40481 is a composite number with 4 divisors. Its prime factorisation is 7 × 5783. Divisors (4): 1, 7, 5783, 40481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40481: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 5783, the product of two primes.
- 2
40481 is composite. Its prime factorisation is
- 3
The divisors add up to 46272; without 40481 itself that is 5791, so 40481 is deficient (5791 is less than 40481). Euler's totient φ(40481) = 34692 numbers up to 40481 share no factor with it.
- 4
The digits of 40481 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40481 = 7 \times 5783 \]
40481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 46272 |
| Euler totient φ(n) | 34692 |
| Square | 1638711361 |
| Cube | 66336674604641 |
| Square root | 201.198907 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.0481 × |
40481 in other forms
| Form | Value |
|---|---|
| In words | forty thousand four hundred and eighty-one |
| Binary (base 2) | 1001111000100001 |
| Octal (base 8) | 117041 |
| Hexadecimal (base 16) | 9E21 |
| Base 3 | 2001112022 |
| As time | 40481 seconds = 11 h 14 min 41 s |
Is 40481 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (40481 ÷ 7 = 5783) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40481 a prime number?
No. 40481 = 7 × 5783, so it is divisible by 7.
What are the factors of 40481?
1, 7, 5783, 40481.
What is 40481 in binary?
1001111000100001 (hexadecimal 9E21, octal 117041).
What is the square root of 40481?
About 201.1989.
Is 40481 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 40481?
40481 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 5783, the product of two primes.