The number 5315
5315 is a composite number with 4 divisors. Its prime factorisation is 5 × 1063. Divisors (4): 1, 5, 1063, 5315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5315: a semiprime: 5 × 1063, the product of two primes.
- 2
5315 is composite. Its prime factorisation is
- 3
The divisors add up to 6384; without 5315 itself that is 1069, so 5315 is deficient (1069 is less than 5315). Euler's totient φ(5315) = 4248 numbers up to 5315 share no factor with it.
- 4
The digits of 5315 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5315 = 5 \times 1063 \]
5315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6384 |
| Euler totient φ(n) | 4248 |
| Square | 28249225 |
| Cube | 150144630875 |
| Square root | 72.904047 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 54 |
| Scientific notation | 5.315 × |
5315 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and fifteen |
| Binary (base 2) | 1010011000011 |
| Octal (base 8) | 12303 |
| Hexadecimal (base 16) | 14C3 |
| Base 3 | 21021212 |
| As time | 5315 seconds = 1 h 28 min 35 s |
Is 5315 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5315 ÷ 5 = 1063) | 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 | 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 5) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5315 a prime number?
No. 5315 = 5 × 1063, so it is divisible by 5.
What are the factors of 5315?
1, 5, 1063, 5315.
What is 5315 in binary?
1010011000011 (hexadecimal 14C3, octal 12303).
What is the square root of 5315?
About 72.9040.
Is 5315 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 5315?
5315 is a semiprime: 5 × 1063, the product of two primes.