The number 40513
40513 is a composite number with 8 divisors. Its prime factorisation is 11 × 29 × 127. Divisors (8): 1, 11, 29, 127, 319, 1397, 3683, 40513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
40513 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
40513 is composite. Its prime factorisation is
- 3
The divisors add up to 46080; without 40513 itself that is 5567, so 40513 is deficient (5567 is less than 40513). Euler's totient φ(40513) = 35280 numbers up to 40513 share no factor with it.
- 4
The digits of 40513 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 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40513 = 11 \times 29 \times 127 \]
40513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 46080 |
| Euler totient φ(n) | 35280 |
| Square | 1641303169 |
| Cube | 66494115285697 |
| Square root | 201.278414 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.0513 × |
40513 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and thirteen |
| Binary (base 2) | 1001111001000001 |
| Octal (base 8) | 117101 |
| Hexadecimal (base 16) | 9E41 |
| Base 3 | 2001120111 |
| As time | 40513 seconds = 11 h 15 min 13 s |
Is 40513 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (40513 ÷ 11 = 3683) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40513 a prime number?
No. 40513 = 11 × 29 × 127, so it is divisible by 11.
What are the factors of 40513?
1, 11, 29, 127, 319, 1397, 3683, 40513.
What is 40513 in binary?
1001111001000001 (hexadecimal 9E41, octal 117101).
What is the square root of 40513?
About 201.2784.
Is 40513 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 40513?
It is a composite number with 8 divisors.