The number 40315
40315 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 733. Divisors (8): 1, 5, 11, 55, 733, 3665, 8063, 40315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
40315 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
40315 is composite. Its prime factorisation is
- 3
The divisors add up to 52848; without 40315 itself that is 12533, so 40315 is deficient (12533 is less than 40315). Euler's totient φ(40315) = 29280 numbers up to 40315 share no factor with it.
- 4
The digits of 40315 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 93 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40315 = 5 \times 11 \times 733 \]
40315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 52848 |
| Euler totient φ(n) | 29280 |
| Square | 1625299225 |
| Cube | 65523938255875 |
| Square root | 200.785956 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 93 |
| Scientific notation | 4.0315 × |
40315 in other forms
| Form | Value |
|---|---|
| In words | forty thousand three hundred and fifteen |
| Binary (base 2) | 1001110101111011 |
| Octal (base 8) | 116573 |
| Hexadecimal (base 16) | 9D7B |
| Base 3 | 2001022011 |
| As time | 40315 seconds = 11 h 11 min 55 s |
Is 40315 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (40315 ÷ 5 = 8063) | 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 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 | No (remainder 3) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (40315 ÷ 11 = 3665) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40315 a prime number?
No. 40315 = 5 × 11 × 733, so it is divisible by 5.
What are the factors of 40315?
1, 5, 11, 55, 733, 3665, 8063, 40315.
What is 40315 in binary?
1001110101111011 (hexadecimal 9D7B, octal 116573).
What is the square root of 40315?
About 200.7860.
Is 40315 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 40315?
It is a composite number with 8 divisors.