The number 70315
70315 is a composite number with 16 divisors. Its prime factorisation is 5 × × 41. Divisors (16): 1, 5, 7, 35, 41, 49, 205, 245, 287, 343, 1435, 1715, 2009, 10045, 14063, 70315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
70315 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
70315 is composite. Its prime factorisation is
- 3
The divisors add up to 100800; without 70315 itself that is 30485, so 70315 is deficient (30485 is less than 70315). Euler's totient φ(70315) = 47040 numbers up to 70315 share no factor with it.
- 4
The digits of 70315 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 70315 = 5 \times 7^{3} \times 41 \]70315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 100800 |
| Euler totient φ(n) | 47040 |
| Square | 4944199225 |
| Cube | 347651368505875 |
| Square root | 265.169757 (= 7√1435) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 143 |
| Scientific notation | 7.0315 × |
70315 in other forms
| Form | Value |
|---|---|
| In words | seventy thousand three hundred and fifteen |
| Binary (base 2) | 10001001010101011 |
| Octal (base 8) | 211253 |
| Hexadecimal (base 16) | 112AB |
| Base 3 | 10120110021 |
| As time | 70315 seconds = 19 h 31 min 55 s |
Is 70315 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 (70315 ÷ 5 = 14063) | 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 | Yes (70315 ÷ 7 = 10045) | 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 7) | 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 | No (remainder 3) | 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 70315 a prime number?
No. 70315 = 5 × × 41, so it is divisible by 5.
What are the factors of 70315?
1, 5, 7, 35, 41, 49, 205, 245, 287, 343, 1435, 1715, 2009, 10045, 14063, 70315.
What is 70315 in binary?
10001001010101011 (hexadecimal 112AB, octal 211253).
What is the square root of 70315?
About 265.1698, exactly 7√1435.
Is 70315 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 70315?
It is a composite number with 16 divisors.