The number 5115
5115 is a palindrome: it reads 5115 backwards too. Its prime factorisation is 3 × 5 × 11 × 31. Divisors (16): 1, 3, 5, 11, 15, 31, 33, 55, 93, 155, 165, 341, 465, 1023, 1705, 5115.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5115: a palindrome: it reads 5115 backwards too.
- 2
5115 is composite. Its prime factorisation is
- 3
The divisors add up to 9216; without 5115 itself that is 4101, so 5115 is deficient (4101 is less than 5115). Euler's totient φ(5115) = 2400 numbers up to 5115 share no factor with it.
- 4
The digits of 5115 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5115 = 3 \times 5 \times 11 \times 31 \]
5115 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 9216 |
| Euler totient φ(n) | 2400 |
| Square | 26163225 |
| Cube | 133824895875 |
| Square root | 71.519228 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 59 |
| Scientific notation | 5.115 × |
5115 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and fifteen |
| Binary (base 2) | 1001111111011 |
| Octal (base 8) | 11773 |
| Hexadecimal (base 16) | 13FB |
| Base 3 | 21000110 |
| As time | 5115 seconds = 1 h 25 min 15 s |
Is 5115 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 | Yes (5115 ÷ 3 = 1705) | 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 (5115 ÷ 5 = 1023) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | 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 (5115 ÷ 11 = 465) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5115 a prime number?
No. 5115 = 3 × 5 × 11 × 31, so it is divisible by 3.
What are the factors of 5115?
1, 3, 5, 11, 15, 31, 33, 55, 93, 155, 165, 341, 465, 1023, 1705, 5115.
What is 5115 in binary?
1001111111011 (hexadecimal 13FB, octal 11773).
What is the square root of 5115?
About 71.5192.
Is 5115 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 5115?
5115 is a palindrome: it reads 5115 backwards too.