The number 4915
4915 is a composite number with 4 divisors. Its prime factorisation is 5 × 983. Divisors (4): 1, 5, 983, 4915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4915: a semiprime: 5 × 983, the product of two primes.
- 2
4915 is composite. Its prime factorisation is
- 3
The divisors add up to 5904; without 4915 itself that is 989, so 4915 is deficient (989 is less than 4915). Euler's totient φ(4915) = 3928 numbers up to 4915 share no factor with it.
- 4
The digits of 4915 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4915 = 5 \times 983 \]
4915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5904 |
| Euler totient φ(n) | 3928 |
| Square | 24157225 |
| Cube | 118732760875 |
| Square root | 70.107061 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.915 × |
4915 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and fifteen |
| Binary (base 2) | 1001100110011 |
| Octal (base 8) | 11463 |
| Hexadecimal (base 16) | 1333 |
| Base 3 | 20202001 |
| As time | 4915 seconds = 1 h 21 min 55 s |
Is 4915 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 (4915 ÷ 5 = 983) | 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 1) | 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 1) | 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 9) | 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 4915 a prime number?
No. 4915 = 5 × 983, so it is divisible by 5.
What are the factors of 4915?
1, 5, 983, 4915.
What is 4915 in binary?
1001100110011 (hexadecimal 1333, octal 11463).
What is the square root of 4915?
About 70.1071.
Is 4915 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 4915?
4915 is a semiprime: 5 × 983, the product of two primes.