The number 4935
4935 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 47. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 47, 105, 141, 235, 329, 705, 987, 1645, 4935.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4935: a Harshad number: divisible by its digit sum 21.
- 2
4935 is composite. Its prime factorisation is
- 3
The divisors add up to 9216; without 4935 itself that is 4281, so 4935 is deficient (4281 is less than 4935). Euler's totient φ(4935) = 2208 numbers up to 4935 share no factor with it.
- 4
The digits of 4935 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 196 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4935 = 3 \times 5 \times 7 \times 47 \]
4935 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 9216 |
| Euler totient φ(n) | 2208 |
| Square | 24354225 |
| Cube | 120188100375 |
| Square root | 70.249555 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 196 |
| Scientific notation | 4.935 × |
4935 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and thirty-five |
| Binary (base 2) | 1001101000111 |
| Octal (base 8) | 11507 |
| Hexadecimal (base 16) | 1347 |
| Base 3 | 20202210 |
| As time | 4935 seconds = 1 h 22 min 15 s |
Is 4935 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 (4935 ÷ 3 = 1645) | 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 (4935 ÷ 5 = 987) | 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 | Yes (4935 ÷ 7 = 705) | 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 7) | 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 | No (remainder 7) | 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 4935 a prime number?
No. 4935 = 3 × 5 × 7 × 47, so it is divisible by 3.
What are the factors of 4935?
1, 3, 5, 7, 15, 21, 35, 47, 105, 141, 235, 329, 705, 987, 1645, 4935.
What is 4935 in binary?
1001101000111 (hexadecimal 1347, octal 11507).
What is the square root of 4935?
About 70.2496.
Is 4935 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 4935?
4935 is a Harshad number: divisible by its digit sum 21.