The number 40504
40504 is a palindrome: it reads 40504 backwards too. Its prime factorisation is × 61 × 83. Divisors (16): 1, 2, 4, 8, 61, 83, 122, 166, 244, 332, 488, 664, 5063, 10126, 20252, 40504.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40504: a palindrome: it reads 40504 backwards too.
- 2
40504 is composite. Its prime factorisation is
- 3
The divisors add up to 78120; without 40504 itself that is 37616, so 40504 is deficient (37616 is less than 40504). Euler's totient φ(40504) = 19680 numbers up to 40504 share no factor with it.
- 4
The digits of 40504 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40504 = 2^{3} \times 61 \times 83 \]40504 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 78120 |
| Euler totient φ(n) | 19680 |
| Square | 1640574016 |
| Cube | 66449809944064 |
| Square root | 201.256056 (= 2√10126) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.0504 × |
40504 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and four |
| Binary (base 2) | 1001111000111000 |
| Octal (base 8) | 117070 |
| Hexadecimal (base 16) | 9E38 |
| Base 3 | 2001120011 |
| As time | 40504 seconds = 11 h 15 min 4 s |
Is 40504 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40504 ÷ 2 = 20252) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (40504 ÷ 4 = 10126) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (40504 ÷ 8 = 5063) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40504 a prime number?
No. 40504 = × 61 × 83, so it is divisible by 2.
What are the factors of 40504?
1, 2, 4, 8, 61, 83, 122, 166, 244, 332, 488, 664, 5063, 10126, 20252, 40504.
What is 40504 in binary?
1001111000111000 (hexadecimal 9E38, octal 117070).
What is the square root of 40504?
About 201.2561, exactly 2√10126.
Is 40504 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 40504?
40504 is a palindrome: it reads 40504 backwards too.